Sciweavers

1300 search results - page 41 / 260
» XML Query Processing and Optimization
Sort
View
EDBTW
2006
Springer
13 years 11 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
2010
IEEE
428views Database» more  ICDE 2010»
14 years 7 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
BTW
2007
Springer
164views Database» more  BTW 2007»
14 years 1 months ago
Integrating Structural Joins into a Tuple-Based XPath Algebra
: Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the tran...
Christian Mathis
ADC
2009
Springer
145views Database» more  ADC 2009»
13 years 11 months ago
Efficient XQuery Join Processing in Publish/Subscribe Systems
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
Ryan H. Choi, Raymond K. Wong
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...