Sciweavers

DEXA
2011
Springer
243views Database» more  DEXA 2011»
13 years 7 days ago
RoSeS: A Continuous Content-Based Query Engine for RSS Feeds
In this article we present RoSeS (Really Open Simple and Efficient Syndication), a generic framework for content-based RSS feed querying and aggregation. RoSeS is based on a data-...
Jordi Creus Tomàs, Bernd Amann, Nicolas Tra...
FUIN
2006
139views more  FUIN 2006»
14 years 13 days 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
VLDB
1989
ACM
104views Database» more  VLDB 1989»
14 years 4 months ago
Gral: An Extensible Relational Database System for Geometric Applications
: We describe the architecture of a relational databasesystem that is extensible by user-defined data types and operations, including relation operations. The central concept is to...
Ralf Hartmut Güting
VLDB
1997
ACM
140views Database» more  VLDB 1997»
14 years 4 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis
SSD
1999
Springer
97views Database» more  SSD 1999»
14 years 4 months ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
VLDB
2004
ACM
124views Database» more  VLDB 2004»
14 years 5 months ago
Automated Statistics Collection in DB2 UDB
The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably lo...
Ashraf Aboulnaga, Peter J. Haas, Sam Lightstone, G...
XIMEP
2004
ACM
88views Database» more  XIMEP 2004»
14 years 5 months ago
XQuery Processing in Natix with an Emphasis on Join Ordering
We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering...
Norman May, Sven Helmer, Carl-Christian Kanne, Gui...
VLDB
2005
ACM
126views Database» more  VLDB 2005»
14 years 6 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
PPAM
2005
Springer
14 years 6 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
SSD
2007
Springer
171views Database» more  SSD 2007»
14 years 6 months ago
Transformation of Continuous Aggregation Join Queries over Data Streams
We address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join ...
Tri Minh Tran, Byung Suk Lee