Sciweavers

139 search results - page 12 / 28
» Compression of inverted indexes for fast query evaluation
Sort
View
EDBT
2006
ACM
255views Database» more  EDBT 2006»
15 years 10 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
CIKM
2008
Springer
14 years 11 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
ADC
2004
Springer
116views Database» more  ADC 2004»
15 years 3 months ago
Index Compression Using Fixed Binary Codewords
Document retrieval and web search engines index large quantities of text. The static costs associated with storing the index can be traded against dynamic costs associated with us...
Vo Ngoc Anh, Alistair Moffat
CN
2010
136views more  CN 2010»
14 years 10 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
VLDB
2001
ACM
92views Database» more  VLDB 2001»
15 years 2 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...