Sciweavers

1419 search results - page 14 / 284
» Searching for Related Objects in Relational Databases
Sort
View
132
Voted
WAIM
2007
Springer
15 years 9 months ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
SSD
2001
Springer
162views Database» more  SSD 2001»
15 years 7 months ago
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
131
Voted
CIKM
2010
Springer
15 years 1 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
179
Voted
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
15 years 7 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
140
Voted
MFDBS
1991
125views Database» more  MFDBS 1991»
15 years 7 months ago
A Relational Algebra for Complex Objects Based on Partial Information
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
Leonid Libkin