716 search results - page 82 / 144 » Optimizing Queries in Extended Relational Databases |
SIGMOD
1996
ACM
15 years 3 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
154
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
133
click to vote
CISM
1993
15 years 3 months ago
1993
The weak instance model is a framework to consider the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and upd...
SIGMOD
1996
ACM
15 years 3 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
111
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...