Sciweavers

3341 search results - page 301 / 669
» On Bounded Queries and Approximation
Sort
View
ADC
2003
Springer
94views Database» more  ADC 2003»
15 years 12 months ago
Multi-resolution Algorithms for Building Spatial Histograms
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
Qing Liu, Yidong Yuan, Xuemin Lin
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
15 years 11 months ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski
VLDB
1989
ACM
150views Database» more  VLDB 1989»
15 years 10 months ago
Aggregates in Possibilistic Databases
Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing p...
Elke A. Rundensteiner, Lubomir Bic
172
Voted
SIGMOD
2010
ACM
154views Database» more  SIGMOD 2010»
15 years 7 months ago
Unbiased estimation of size and other aggregates over hidden web databases
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang...
ASUNAM
2011
IEEE
14 years 6 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...