Sciweavers

354 search results - page 12 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
DATESO
2008
131views Database» more  DATESO 2008»
13 years 8 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
DEXA
2006
Springer
139views Database» more  DEXA 2006»
13 years 11 months ago
Efficient Processing of Multiple XML Twig Queries
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...
Huanzhang Liu, Tok Wang Ling, Tian Yu, Ji Wu
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
14 years 8 months ago
Evaluating Window Joins over Unbounded Streams
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 8 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
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...