Sciweavers

505 search results - page 10 / 101
» Efficient Temporal Join Processing Using Indices
Sort
View
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 8 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...
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 8 months ago
Querying Complex Spatio-Temporal Sequences in Human Motion Databases
Content-based retrieval of spatio-temporal patterns from human motion databases is inherently nontrivial since finding effective distance measures for such data is difficult. These...
Yueguo Chen, Shouxu Jiang, Beng Chin Ooi, Anthony ...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 7 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 7 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...