Sciweavers

301 search results - page 59 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
15 years 11 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
ICDE
2001
IEEE
149views Database» more  ICDE 2001»
16 years 5 days ago
Selectivity Estimation for Spatial Joins
Spatial Joins are important and time consuming operations in spatial database management systems. It is crucial to be able to accurately estimate the performance of these operatio...
Ning An, Zhen-Yu Yang, Anand Sivasubramaniam
84
Voted
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
15 years 5 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
EDBT
2010
ACM
152views Database» more  EDBT 2010»
15 years 2 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
85
Voted
WWW
2005
ACM
15 years 11 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan