Sciweavers

552 search results - page 11 / 111
» On the Complexity of Join Predicates
Sort
View
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 1 days ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
DMDW
2000
161views Management» more  DMDW 2000»
13 years 8 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
14 years 23 days ago
Estimating XML Structural Join Size Quickly and Economically
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yan, Ch...
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 6 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
14 years 8 months ago
Index-Based Approximate XML Joins
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...