Sciweavers

777 search results - page 54 / 156
» Optimization of Relational Preference Queries
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 10 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
PVLDB
2010
139views more  PVLDB 2010»
13 years 4 months ago
Identifying the Most Influential Data Objects with Reverse Top-k Queries
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
SIGMOD
1996
ACM
112views Database» more  SIGMOD 1996»
14 years 2 months ago
Performance Tradeoffs for Client-Server Query Processing
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
Michael J. Franklin, Björn Þór J...
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
14 years 10 months ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...
VLDB
2004
ACM
93views Database» more  VLDB 2004»
14 years 3 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich