Sciweavers

60 search results - page 10 / 12
» A pruning-based approach for supporting Top-K join queries
Sort
View
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 3 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 1 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
82
Voted
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
15 years 4 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
15 years 9 months ago
Column-stores vs. row-stores: how different are they really?
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...
Daniel J. Abadi, Samuel Madden, Nabil Hachem
INFOCOM
2006
IEEE
15 years 3 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo