777 search results - page 49 / 156 » Optimization of Relational Preference Queries |
ICDT
1995
ACM
14 years 15 days ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
VLDB
1987
ACM
14 years 13 days ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
DASFAA
2004
IEEE
14 years 21 days 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...
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
SIGMOD
2007
ACM
14 years 9 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...