2883 search results - page 2 / 577 » Algorithms for merged indexes |
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
HIPC
2009
Springer
13 years 2 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
VLDB
1999
ACM
13 years 9 months ago
1999
ACM
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...