995 search results - page 55 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
140
click to vote
SIGMOD
2010
ACM
15 years 9 days ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
105
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
124
click to vote
VLDB
1987
ACM
15 years 5 months ago
1987
ACM
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...
131
Voted
GVD
2003
15 years 3 months ago
2003
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
125
click to vote
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...