Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Implicit_data_structure> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Implicit_data_structure abstract "In computer science, an implicit data structure is a data structure that uses very little memory besides the actual data elements i.e. very little information other than main data is stored in these structures. These are storage schemes which retain no pointers and represent the file of n k-key records as a simple n by k array n thus retrieve faster. In implicit data structures the only structural information to be given is to allow the array to grow and shrink as n. No extra information is required. It is called "implicit" because most of the structure of the elements is expressed implicitly by their order. Another term used interchangeably is space efficient. Definitions of “very little” are vague and can mean from O(1) to O(log n) extra space. Everything is accessed in-place, by reading bits at various positions in the data. To achieve optimal coding, we use bits instead of bytes. Implicit data structures are frequently also succinct data structures.Although one may argue that disk space is no longer a problem and we should not concern ourselves with improving space utilization, the issue that implicit data structures are designed to improve is main memory utilization. Hard disks, or any other means of large data capacity, I/O devices, are orders of magnitudes slower than main memory. Hence, the higher percentage of a task can fit in buffers in main memory the less dependence is on slow I/O devices. Hence, if a larger chunk of an implicit data structure fits in main memory the operations performed on it can be faster even if the asymptotic running time is not as good as its space-oblivious counterpart. Furthermore, since the CPU-cache is usually much smaller than main-memory, implicit data structures can improve cache-efficiency and thus running speed, especially if the method used improves locality.".
- Implicit_data_structure wikiPageExternalLink ~hbr.
- Implicit_data_structure wikiPageExternalLink gnf.
- Implicit_data_structure wikiPageExternalLink ~imunro.
- Implicit_data_structure wikiPageID "3669635".
- Implicit_data_structure wikiPageRevisionID "515155102".
- Implicit_data_structure hasPhotoCollection Implicit_data_structure.
- Implicit_data_structure subject Category:Data_structures.
- Implicit_data_structure type Abstraction100002137.
- Implicit_data_structure type Arrangement105726596.
- Implicit_data_structure type Cognition100023271.
- Implicit_data_structure type DataStructure105728493.
- Implicit_data_structure type DataStructures.
- Implicit_data_structure type PsychologicalFeature100023100.
- Implicit_data_structure type Structure105726345.
- Implicit_data_structure comment "In computer science, an implicit data structure is a data structure that uses very little memory besides the actual data elements i.e. very little information other than main data is stored in these structures. These are storage schemes which retain no pointers and represent the file of n k-key records as a simple n by k array n thus retrieve faster. In implicit data structures the only structural information to be given is to allow the array to grow and shrink as n.".
- Implicit_data_structure label "Implicit data structure".
- Implicit_data_structure sameAs m.09tgxx.
- Implicit_data_structure sameAs Q16707838.
- Implicit_data_structure sameAs Q16707838.
- Implicit_data_structure sameAs Implicit_data_structure.
- Implicit_data_structure wasDerivedFrom Implicit_data_structure?oldid=515155102.
- Implicit_data_structure isPrimaryTopicOf Implicit_data_structure.