995 search results - page 66 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
165
click to vote
DASFAA
2004
IEEE
15 years 5 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
185
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
In response to the widespread use of the XML format for document representation and message exchange, major database vendors support XML in terms of persistence, querying and inde...
134
click to vote
PPDP
2010
Springer
14 years 12 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
139
click to vote
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
157
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...