Sciweavers

735 search results - page 76 / 147
» Query Optimization In Compressed Database Systems
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
13 years 8 months ago
Graceful database schema evolution: the PRISM workbench
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
14 years 10 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
FUIN
2006
139views more  FUIN 2006»
13 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
WWW
2004
ACM
14 years 9 months ago
Index structures and algorithms for querying distributed RDF repositories
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Sui...
Heiner Stuckenschmidt, Richard Vdovjak, Geert-Jan ...
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
14 years 10 months ago
Online Tuning of Aggregation Tables for OLAP
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
Katja Hose, Daniel Klan, Kai-Uwe Sattler