958 search results - page 82 / 192 » Efficient data structures for range-aggregate queries on tre... |
87
Voted
SODA
2012
ACM
13 years 17 days ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
134
click to vote
AINA
2009
IEEE
15 years 5 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
IPL
2010
14 years 8 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
GFKL
2007
Springer
15 years 2 months ago
2007
Springer
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
157
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...