52 search results - page 3 / 11 » HDoV-tree: The Structure, The Storage, The Speed |
VMV
2001
13 years 7 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
ISMVL
1996
IEEE
13 years 10 months ago
1996
IEEE
A novel architecturefor a Multiple-Valued Ferroelectric Content-Addressable Memory (FCAM) is proposed. An FCAM employs ferroelectric capacitors as storage elements to provide a no...
TDM
2004
13 years 7 months ago
2004
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...