Sciweavers

75 search results - page 6 / 15
» Optimal splitters for database partitioning with size bounds
Sort
View
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 7 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
14 years 7 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
ICDT
1999
ACM
97views Database» more  ICDT 1999»
13 years 12 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
14 years 1 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
14 years 9 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...