Sciweavers

435 search results - page 36 / 87
» Querying Inconsistent Databases: Algorithms and Implementati...
Sort
View
APWEB
2004
Springer
14 years 2 months ago
Improving XML Query Performance Using Social Classes
In a state-of-the-art XML database, an XML query is evaluated as a sequence of structural joins in which positions of data nodes are used to perform each individual structural joi...
Weining Zhang, Douglas Pollok
DOLAP
2003
ACM
14 years 2 months ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos
SIGMOD
2003
ACM
106views Database» more  SIGMOD 2003»
14 years 9 months ago
XPath Processing in a Nutshell
We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize efficient algorithms for processing queries in this language. Our presentation is int...
Georg Gottlob, Christoph Koch, Reinhard Pichler
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 9 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
GEOINFO
2003
13 years 10 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...