Sciweavers

54 search results - page 2 / 11
» Answering approximate string queries on large data sets usin...
Sort
View
VLDB
2004
ACM
227views Database» more  VLDB 2004»
13 years 10 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 4 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
13 years 9 months ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 4 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
VLDB
2001
ACM
114views Database» more  VLDB 2001»
13 years 9 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons