Sciweavers

2859 search results - page 17 / 572
» Querying Complex Structured Databases
Sort
View
EDBT
1998
ACM
155views Database» more  EDBT 1998»
14 years 3 days ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ICDT
1995
ACM
96views Database» more  ICDT 1995»
13 years 11 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
VLDB
1992
ACM
151views Database» more  VLDB 1992»
13 years 12 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu
SEBD
1996
94views Database» more  SEBD 1996»
13 years 9 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
14 years 9 months ago
Mining, Indexing, and Similarity Search in Graphs and Complex Structures
Jiawei Han, Xifeng Yan, Philip S. Yu