Results 1 - 10 of 555

Spatial Data Structures

by Hanan Samet , 1995
"... An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Suchtechniques are known as spatial indexing methods. Hierarch ..."
Abstract - Cited by 333 (13 self) - Add to MetaCart
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Suchtechniques are known as spatial indexing methods

Recursive Partitioning Method for Trajectory Indexing

by Elizabeth Antoine, Kotagiri Ramamohanarao, Jie Shao, Rui Zhang
"... A trajectory is defined as the record of time-varying spatial phenomenon. The trajectory database is an important research area that has received a lot of interest in the last decade, with the objective of trajectory databases being to extend existing database technology to support the representatio ..."
Abstract - Add to MetaCart
in handling coordinate-based queries. The structure of RPTI can be easily implemented by using any of the existing spatial indexing structures. The only design parameters required are the standard disk page size and maximum level of recursive partitioning.

Partition Based Spatial-Merge Join

by Jignesh M. Patel, David J. DeWitt , 1996
"... This paper describes PBSM (Partition Based Spatial--Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are interme ..."
Abstract - Cited by 184 (12 self) - Add to MetaCart
This paper describes PBSM (Partition Based Spatial--Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join

An extensible index for spatial databases

by Walid G. Aref, Ihab F. Ilyas - In Statistical and Scientific Database Management , 2001
"... Emerging database applications require the use of new indexing structures beyond B-trees and R-trees. Examples are the k-D tree, the trie, the quadtree, and their variants. They are often proposed as supporting structures in data mining, GIS, and CAD/CAM applications. A common feature of all these i ..."
Abstract - Cited by 13 (7 self) - Add to MetaCart
these indexes is that they recursively divide the space into partitions. A new extensible index structure, termed SP-GiST, is presented that supports this class of data structures, mainly the class of space partitioning unbalanced trees. Simple method implementations are provided that demonstrate how SP

MOIST: A Scalable and Parallel Moving Object Indexer with School Tracking

by Junchen Jiang, Hongji Bao, Edward Y. Chang, Yuqian Li
"... Location-Based Service (LBS) is rapidly becoming the next ubiquitous technology for a wide range of mobile applications. To support applications that demand nearest-neighbor and history queries, an LBS spatial indexer must be able to efficiently update, query, archive and mine location records, whic ..."
Abstract - Add to MetaCart
, which can be in contention with each other. In this work, we propose MOIST, whose baseline is a recursive spatial partitioning indexer built upon BigTable. To reduce update and query contention, MOIST groups nearby objects of similar trajectory into the same school, and keeps track of only the history

Sp-gist: An extensible database index for supporting space partitioning trees

by Walid G. Aref, Ihab F. Ilyas - J. Intell. Inf. Syst
"... Abstract. Emerging database applications require the use of new indexing structures beyond B-trees and R-trees. Examples are the k-D tree, the trie, the quadtree, and their variants. They are often proposed as supporting structures in data mining, GIS, and CAD/CAM applications. A common feature of a ..."
Abstract - Cited by 26 (9 self) - Add to MetaCart
of all these indexes is that they recursively divide the space into partitions. A new extensible index structure, termed SP-GiST is presented that supports this class of data structures, mainly the class of space partitioning unbalanced trees. Simple method implementations are provided that demonstrate

Pattern discovery by residual analysis and recursive partitioning

by Tom Chau, Andrew K. C. Wong - IEEE Transactions on Knowledge and Data Engineering , 1999
"... AbstractÐIn this paper, a novel method of pattern discovery is proposed. It is based on the theoretical formulation of a contingency table of events. Using residual analysis and recursive partitioning, statistically significant events are identified in a data set. These events constitute the importa ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
, and tolerance to noncentralized noise. Index TermsÐPattern discovery, residual analysis, recursive partitioning, events, contingency tables.

On Spatially Partitioned Temporal Join

by Hongjun Lu, Beng-chin Ooi, Kian-lee Tan - Proc. of VLDB , 1994
"... This paper presents an innovative partition-based time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to points in a two dimensional space and partitions the space into subspaces. Tu-pies of a temporal relation are clustered ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
. The use of spa-tial indexing techniques to support direct ac-cess to the stored partitions is discussed. The results of a preliminary performance study in-dicate the efficiency of the proposed method. 1

Efficient Query Processing on Relational Data-Partitioning Index Structures

by Hans-peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz
"... In contrast to space-partitioning index structures, data-partitioning index structures naturally adapt to the actual data distribution which results in a very good query response behavior. Besides efficient query processing, modern database applications including computer-aided design, medical imagi ..."
Abstract - Add to MetaCart
In contrast to space-partitioning index structures, data-partitioning index structures naturally adapt to the actual data distribution which results in a very good query response behavior. Besides efficient query processing, modern database applications including computer-aided design, medical

Brep-Index: A Multidimensional Space Partitioning Tree

by George Vanecek, Jr. , 1991
"... In this paper we present the Brep-index, a multidimensional space partitioning data structure that provides quick spatial access to the vertices, edges and faces of a boundary representation (Brep), thus yielding a single unified representation for polyhedral solids. We give an algorithm for the con ..."
Abstract - Cited by 24 (4 self) - Add to MetaCart
In this paper we present the Brep-index, a multidimensional space partitioning data structure that provides quick spatial access to the vertices, edges and faces of a boundary representation (Brep), thus yielding a single unified representation for polyhedral solids. We give an algorithm
Results 1 - 10 of 555