Sciweavers

109 search results - page 6 / 22
» Index Merging
Sort
View
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 8 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
CLEF
2007
Springer
14 years 1 months ago
MIRACLE at ImageCLEFphoto 2007: Evaluation of Merging Strategies for Multilingual and Multimedia Information Retrieval
This paper describes the participation of MIRACLE research consortium at the ImageCLEF Photographic Retrieval task of ImageCLEF 2007. For this campaign, the main purpose of our ex...
Julio Villena-Román, Sara Lana-Serrano, Jos...
EDBT
2010
ACM
122views Database» more  EDBT 2010»
14 years 2 months ago
Self-selecting, self-tuning, incrementally optimized indexes
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...
Goetz Graefe, Harumi A. Kuno
ECIR
2006
Springer
13 years 8 months ago
A Hybrid Approach to Index Maintenance in Dynamic Text Retrieval Systems
In-place and merge-based index maintenance are the two main competing strategies for on-line index construction in dynamic information retrieval systems based on inverted lists. Mo...
Stefan Büttcher, Charles L. A. Clarke
BDA
2004
13 years 8 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin