109 search results - page 2 / 22 » Index Merging |
SIGMOD
2005
ACM
14 years 7 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...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
ICDE
2010
IEEE
13 years 7 months ago
2010
IEEE
: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking A...
VLDB
1999
ACM
13 years 11 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...
ESWS
2004
Springer
14 years 22 days ago
2004
Springer
Existing efforts on ontology mapping, alignment and merging vary from methodological and theoretical frameworks, to methods and tools that support the semi-automatic coordination o...