Sciweavers

995 search results - page 152 / 199
» Optimization of Complex Nested Queries in Relational Databas...
Sort
View
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
15 years 1 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 2 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
ADBIS
2010
Springer
136views Database» more  ADBIS 2010»
15 years 3 months ago
New Frontiers in Business Intelligence: Distribution and Personalization
Abstract. To meet the new, more sophisticated needs of decision makers, a new generation of BI systems is emerging. In this paper we focus on two enabling technologies for this new...
Stefano Rizzi
CIKM
2005
Springer
15 years 7 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
120
Voted
DAGSTUHL
2004
15 years 3 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...