Sciweavers

929 search results - page 133 / 186
» Answering imprecise database queries: a novel approach
Sort
View
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
15 years 12 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
AICOM
2004
118views more  AICOM 2004»
14 years 11 months ago
Qualitative pattern matching with linguistic terms
Abstract. In the framework of possibility theory, a tool named `fuzzy pattern matching' (FPM) has been proposed in the eighties and since successfully used in flexible queryin...
Yannick Loiseau, Henri Prade, Mohand Boughanem
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
15 years 12 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SIGMOD
1999
ACM
110views Database» more  SIGMOD 1999»
15 years 4 months ago
Multi-dimensional Selectivity Estimation Using Compressed Histogram Information
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
Ju-Hong Lee, Deok-Hwan Kim, Chin-Wan Chung
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 2 days ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...