Sciweavers

2883 search results - page 85 / 577
» Algorithms for merged indexes
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
12 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, ...
CIKM
2009
Springer
14 years 4 months ago
Bitmap indexes for relational XML twig query processing
Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or...
Kyong-Ha Lee, Bongki Moon
GIS
2007
ACM
14 years 1 months ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
14 years 2 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
14 years 2 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer