On 8/31/14 2:25 PM, Kingsley Idehen wrote:
> On 8/30/14 11:01 PM, John F Sowa wrote:
>> David, Phil, and John B,
>>
>> I suggest a very simple definition for Big Data:
>>
>> Data whose size N (in bytes) is so large that any algorithm that
>> takes time that is polynomial in N (for any exponent greater than 1)
>> is prohibitively expensive with existing hardware.
>>
>> This definition scales with the technology. It was true in 1960, when
>> people did research on sorting algorithms that took (N log N) time.
>>
>> The computers today are a million times bigger and faster than in 1960,
>> but BIg Data today cannot be processed by any polynomial algorithm
>> (with an exponent greater than 1).
>>
>> And that definition will still be true when computers are a million
>> times bigger and faster than today's.
>>
>> John
> John,
>
> Nice contribution to the definition of "Big Data" . I am going to
> incorporate this into some of the definitions we maintain, as part of
> the Linked Open Data cloud, via the nanotations below:
>
> ## Turtle Start ##
>
> <#BigData>
> a skos:Concept;
> owl:sames
> <http://www.openlinksw.com/data/turtle/general/GlossaryOfTerms.ttl#BigData>,
>
> <http://dbpedia.org/resource/Big_data> ;
> rdfs:comment """
>
> Data whose size N (in bytes) is so large that any algorithm that
> takes time that is polynomial in N (for any exponent greater than 1)
> is prohibitively expensive with existing hardware.
>
> This definition scales with the technology. It was true in 1960, when
> people did research on sorting algorithms that took (N log N) time.
>
> The computers today are a million times bigger and faster than in 1960,
> but BIg Data today cannot be processed by any polynomial algorithm
> (with an exponent greater than 1).
>
> And that definition will still be true when computers are a million
> times bigger and faster than today's -- John F. Sowa.""" ;
> dcterms:referencedBy <#thisPost> .
>
>
> ## Turtle End ## (01)
Just fixing the statements above since I am importing them directly into
the LOD cloud. Basically, owl:sames should have been owl:sameAs. (02)
## Nanotation Start ## (03)
<#BigData>
a skos:Concept;
is foaf:primaryTopic of <>;
owl:samesAs
<http://www.openlinksw.com/data/turtle/general/GlossaryOfTerms.ttl#BigData>, (04)
<http://dbpedia.org/resource/Big_data> ;
rdfs:comment """ (05)
Data whose size N (in bytes) is so large that any algorithm that
takes time that is polynomial in N (for any exponent greater than 1)
is prohibitively expensive with existing hardware. (06)
This definition scales with the technology. It was true in 1960, when
people did research on sorting algorithms that took (N log N) time. (07)
The computers today are a million times bigger and faster than in 1960,
but BIg Data today cannot be processed by any polynomial algorithm
(with an exponent greater than 1). (08)
And that definition will still be true when computers are a million
times bigger and faster than today's -- John F. Sowa.""" ;
dcterms:referencedBy <#thisPost> . (09)
## Nanotation End ## (010)
--
Regards, (011)
Kingsley Idehen
Founder & CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog 1: http://kidehen.blogspot.com
Personal Weblog 2: http://www.openlinksw.com/blog/~kidehen
Twitter Profile: https://twitter.com/kidehen
Google+ Profile: https://plus.google.com/+KingsleyIdehen/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen
Personal WebID: http://kingsley.idehen.net/dataspace/person/kidehen#this (012)
smime.p7s
Description: S/MIME Cryptographic Signature
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (01)
|