Sciweavers

1588 search results - page 180 / 318
» Consistent query answering in databases
Sort
View
126
Voted
SSDBM
2008
IEEE
115views Database» more  SSDBM 2008»
15 years 11 months ago
Breaking the Curse of Cardinality on Bitmap Indexes
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
Kesheng Wu, Kurt Stockinger, Arie Shoshani
VLDB
2005
ACM
226views Database» more  VLDB 2005»
15 years 10 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
DATESO
2007
104views Database» more  DATESO 2007»
15 years 6 months ago
Shape Extraction Framework for Similarity Search in Image Databases
The task of similarity search in image databases has been studied for decades, while there have been many feature extraction techniques proposed. Among the mass of low-level techni...
Jan Klima, Tomás Skopal
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 5 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 11 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...