Sciweavers

168 search results - page 8 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
DOLAP
2005
ACM
13 years 9 months ago
Optimizing the incremental maintenance of multiple join views
Materialized views are nowadays commonly used in the data warehouse environment. Materialized views need to be updated when data sources change. Since the update of the views may ...
Ki Yong Lee, Myoung-Ho Kim
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
13 years 12 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
VLDB
1994
ACM
91views Database» more  VLDB 1994»
13 years 12 months ago
On Spatially Partitioned Temporal Join
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
Hongjun Lu, Beng Chin Ooi, Kian-Lee Tan
SIGMOD
1997
ACM
113views Database» more  SIGMOD 1997»
13 years 11 months ago
Size Separation Spatial Join
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
Nick Koudas, Kenneth C. Sevcik
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
14 years 9 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...