Sciweavers

6315 search results - page 931 / 1263
» Approximating Solution Structure
Sort
View
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 5 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
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
16 years 5 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
131
Voted
PODS
2003
ACM
116views Database» more  PODS 2003»
16 years 5 months ago
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
Charu C. Aggarwal, Dakshi Agrawal
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 5 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
168
Voted
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 5 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin