Sciweavers

1846 search results - page 117 / 370
» Fuzzy queries and relational databases
Sort
View
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 7 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 6 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
156
Voted
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 11 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
127
Voted
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
15 years 4 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 11 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...