Sciweavers

356 search results - page 8 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
EDBTW
2006
Springer
15 years 1 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 11 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...
PODS
1999
ACM
133views Database» more  PODS 1999»
15 years 1 months ago
Processing and Optimization of Multiway Spatial Joins Using R-Trees
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
Dimitris Papadias, Nikos Mamoulis, Yannis Theodori...
189
Voted
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
15 years 9 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...
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
15 years 3 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...