Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Fundamental techniques for order optimization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Duplicate record elimination in large data files
ACM Transactions on Database Systems (TODS)
Introduction to Algorithms
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Sort-Merge-Join: An Idea Whose Time Has(h) Passed?
Proceedings of the Tenth International Conference on Data Engineering
The MD-join: An Operator for Complex OLAP
Proceedings of the 17th International Conference on Data Engineering
Hash Joins and Hash Teams in Microsoft SQL Server
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
From Nested-Loop to Join Queries in OODB
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Evaluation of Aggregates on Bulk Types
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
Nested Queries and Quantifiers in an Ordered Context
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Strategies for query unnesting in XML databases
ACM Transactions on Database Systems (TODS)
Dynamic programming strikes back
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient XQuery evaluation of grouping conditions with duplicate removals
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
| Hi-index | 0.00 |
An increasing number of applications depend on efficient storage and analysis features for XML data. Hence, query optimization and efficient evaluation techniques for the emerging XQuery standard become more and more important. Many XQuery queries require nested expressions. Unnesting them often introduces binary grouping. We introduce several algorithms implementing binary grouping and analyze their time and space complexity. Experiments demonstrate their performance.