Sciweavers

139 search results - page 14 / 28
» Compression of inverted indexes for fast query evaluation
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 13 days ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
ICSNC
2007
IEEE
15 years 4 months ago
Efficient Transformation Scheme for Indexing Continuous Queries on RFID Streaming Data
RFID data are usually regarded as streaming data that are huge and change frequently because they are gathered continuously by numerous readers. RFID middleware filters the data a...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban
DATESO
2009
158views Database» more  DATESO 2009»
14 years 7 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
VLDB
1998
ACM
87views Database» more  VLDB 1998»
15 years 2 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
ACSC
2004
IEEE
15 years 1 months ago
In-Place versus Re-Build versus Re-Merge: Index Maintenance Strategies for Text Retrieval Systems
Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithm...
Nicholas Lester, Justin Zobel, Hugh E. Williams