613 search results - page 50 / 123 » Query Evaluation on a Database Given by a Random Graph |
225
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
129
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
236
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
144
Voted
PVLDB
2010
15 years 2 months ago
2010
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
141
Voted
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...