148 search results - page 1 / 30 » Query Evaluation via Tree-Decompositions |
ICDT
2001
ACM
13 years 9 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
VLDB
2012
ACM
12 years 6 days ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
CORR
2012
Springer
12 years 11 days ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—This paper considers a novel distributed system for collaborative location-based information generation and sharing which become increasingly popular due to the explosiv...