777 search results - page 76 / 156 » Optimization of Relational Preference Queries |
134
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
137
Voted
BDA
2007
15 years 4 months ago
2007
Pervasive information systems give an overview of what digital environments should look like in the future. From a data-centric point of view, traditional databases have to be use...
122
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
121
Voted
SSDBM
2008
IEEE
15 years 9 months ago
2008
IEEE
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (p...
213
Voted
VLDB
2006
ACM
16 years 3 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...