Sciweavers

511 search results - page 17 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
SIGMOD
2008
ACM
113views Database» more  SIGMOD 2008»
15 years 5 months ago
Supporting OLAP operations over imperfectly integrated taxonomies
OLAP is an important tool in decision support. With the help of domain knowledge, such as hierarchies of attribute values, OLAP helps the user observe the effects of various decis...
Yan Qi 0002, K. Selçuk Candan, Jun'ichi Tat...
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 5 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
144
Voted
STACS
2001
Springer
15 years 10 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 5 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
VLDB
2002
ACM
161views Database» more  VLDB 2002»
15 years 5 months ago
Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over many s...
Panagiotis G. Ipeirotis, Luis Gravano