Sciweavers

1300 search results - page 95 / 260
» XML Query Processing and Optimization
Sort
View
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
13 years 12 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
PVLDB
2010
103views more  PVLDB 2010»
13 years 6 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
14 years 9 months ago
Evaluating TOP-K Queries over Business Processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifica...
Daniel Deutch, Tova Milo
PVLDB
2010
123views more  PVLDB 2010»
13 years 6 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 7 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher