Sciweavers

382 search results - page 41 / 77
» Data Structures for Dynamic Queries: An Analytical and Exper...
Sort
View
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
CIKM
2005
Springer
14 years 1 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 7 months ago
Multi-dimensional search for personal information management systems
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...
Amélie Marian, Christopher Peery, Thu D. Ng...
PDP
2008
IEEE
14 years 2 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
DEXA
2007
Springer
141views Database» more  DEXA 2007»
14 years 1 months ago
Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and...
Sven Helmer, Robin Aly, Thomas Neumann, Guido Moer...