958 search results - page 46 / 192 » Efficient data structures for range-aggregate queries on tre... |
125
click to vote
CLUSTER
2005
IEEE
15 years 6 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
101
Voted
BTW
2007
Springer
15 years 4 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
120
click to vote
SODA
1990
ACM
15 years 1 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
114
Voted
NBIS
2007
Springer
15 years 6 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
127
Voted
EDBT
2004
ACM
16 years 18 days ago
2004
ACM
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...