Sciweavers

574 search results - page 54 / 115
» Distributed Queries and Query Optimization in Schema-Based P...
Sort
View
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 1 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
ICDCS
2008
IEEE
14 years 3 months ago
Routing of XML and XPath Queries in Data Dissemination Networks
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of ...
Guoli Li, Shuang Hou, Hans-Arno Jacobsen
PVLDB
2010
146views more  PVLDB 2010»
13 years 3 months ago
Generating Efficient Execution Plans for Vertically Partitioned XML Databases
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
Patrick Kling, M. Tamer Özsu, Khuzaima Daudje...
CSR
2007
Springer
14 years 3 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...