Sciweavers

1160 search results - page 83 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
93
Voted
LAWEB
2005
IEEE
15 years 3 months ago
Optimized Index Structures for Querying RDF from the Web
Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for th...
Andreas Harth, Stefan Decker
73
Voted
DEXA
2000
Springer
98views Database» more  DEXA 2000»
15 years 2 months ago
Optimal Page Ordering for Region Queries in Static Spatial Databases
Page ordering is to define the order of pages in one-dimensional storage for storing two-dimensional spatial data to reduce the number of disk seeks. Previous works relating to pag...
Daesoo Cho, Bonghee Hong
104
Voted
CIKM
2007
Springer
15 years 2 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
ADBIS
2007
Springer
126views Database» more  ADBIS 2007»
15 years 2 months ago
Optimal Query Mapping in Mobile OLAP
Query mapping to aggregation lattices is used in order to exploit sub-cube dependencies in multidimensional databases. It is employed in mobile OLAP dissemination systems, in order...
Ilias Michalarias, Hans-Joachim Lenz
82
Voted
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
15 years 10 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...