Sciweavers

277 search results - page 27 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
IDEAS
2000
IEEE
108views Database» more  IDEAS 2000»
14 years 1 months ago
Plug and Play with Query Algebras: SECONDO-A Generic DBMS Development Environment
We present SECONDO, a new generic environment supporting the implementation of database systems for a wide range of data models and query languages. On the one hand, this framewor...
Stefan Dieker, Ralf Hartmut Güting
ICDE
2006
IEEE
112views Database» more  ICDE 2006»
14 years 10 months ago
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
Ashraf Aboulnaga, Ihab F. Ilyas, M. Tamer Özs...
IPPS
1997
IEEE
14 years 1 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
14 years 3 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 10 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee