2850 search results - page 155 / 570 » Answering Queries using Humans, Algorithms and Databases |
108
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
199
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
148
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
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...
120
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
130
click to vote
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...