Please use this identifier to cite or link to this item:
|Title:||SliceSort: Efficient sorting of hierarchical data||Authors:||Tran, Q.T.
|Issue Date:||2012||Citation:||Tran, Q.T.,Chan, C.-Y. (2012). SliceSort: Efficient sorting of hierarchical data. ACM International Conference Proceeding Series : 2109-2113. ScholarBank@NUS Repository. https://doi.org/10.1145/2396761.2398583||Abstract:||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%. © 2012 ACM.||Source Title:||ACM International Conference Proceeding Series||URI:||http://scholarbank.nus.edu.sg/handle/10635/42061||ISBN:||9781450311564||DOI:||10.1145/2396761.2398583|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.