Change detection in hierarchically structured information
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Detecting Changes in XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
ACM Transactions on Database Systems (TODS)
NEXSORT: Sorting XML in External Memory
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Sorting hierarchical data in external memory for archiving
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Sorting is a fundamental operation in data processing. While the problem of sorting flat data records has been extensively studied, there is very little work on sorting hierarchical data such as XML documents. Existing hierarchy-aware sorting approaches for hierarchical data are based on creating sorted subtrees as initial sorted runs and merging sorted subtrees to create the sorted output using either explicit pointers or absolute node key comparisons for merging subtrees. In this paper, we propose SliceSort, a novel, level-wise sorting technique for hierarchical data that avoids the drawbacks of subtree-based sorting techniques. Our experimental performance evaluation shows that SliceSort outperforms the state-of-art approach, HErMeS, by up to a factor of 27%.