Sciweavers

806 search results - page 34 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
DATESO
2008
131views Database» more  DATESO 2008»
13 years 9 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
ICALP
1999
Springer
13 years 12 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
13 years 12 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
SEMWEB
2010
Springer
13 years 5 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
DAWAK
2001
Springer
14 years 5 days ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos