735 search results - page 44 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
ICDT
2007
ACM
15 years 6 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
ENTCS
2002
14 years 11 months ago
2002
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
We have architected and evaluated a new kind of data resource, one that is composed of a logical collection of ephemeral data streams that could be viewed as a collection of publi...
122
click to vote
SIGMOD
2003
ACM
16 years 1 days ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
162
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...