2883 search results - page 375 / 577 » Algorithms for merged indexes |
SENSYS
2005
ACM
14 years 2 months ago
2005
ACM
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
DOLAP
2003
ACM
14 years 2 months ago
2003
ACM
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...