342 search results - page 27 / 69 » Conjunctive Queries over Trees |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
SMC
2010
IEEE
13 years 6 months ago
2010
IEEE
—We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic...
DBPL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
ALENEX
2003
13 years 9 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...