Sciweavers

735 search results - page 86 / 147
» Query Optimization In Compressed Database Systems
Sort
View
PPAM
2005
Springer
14 years 2 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. 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 algorit...
Dariusz Dereniowski, Marek Kubale
SIGMOD
2008
ACM
134views Database» more  SIGMOD 2008»
14 years 9 months ago
SystemT: a system for declarative information extraction
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghava...
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 9 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
BTW
2003
Springer
94views Database» more  BTW 2003»
14 years 2 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
BDA
2007
13 years 10 months ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...