792 search results - page 18 / 159 » Computing Iceberg Queries Efficiently |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
COLING
2010
13 years 4 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
ICPR
2010
IEEE
14 years 9 days ago
2010
IEEE
Visual exploration systems enable users to search, browse, and explore voluminous multimedia databases in an interactive and playful manner. Whether users know the database's ...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents an efficient tree-based query protocol for tag identification in Radio Frequency Identification (RFID) systems. Instead of reducing collisions, our proposed pro...