Abstract
The linear storage model is widely used to support in- memory multi-key search running on small devices of limited computing capacity, simply because it avoids the maintenance of space-costly and energy-costly indexing structures. However, it only supports sequential multi-key scan which is slow and energy-consuming. We design an index structure called D-Tree to address the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J.L.: Multidimentional binary search trees used for associative searching. Communications of the ACM 18(9), 509–517 (1975)
Comer, D.: The ubiquitous b-tree. ACM Computing Surveys 11(2), 121–137 (1979)
Li, X., Kim, Y.J., Govindan, R., Hong, W.: Multi-dimensional range queries in sensor networks. In: SenSys, pp. 63–75 (2003)
O’Neil, P., Quass, D.: Improved query performance with variant indexes. In: SIGMOD, pp. 38–49 (1997)
Shi, C., Yan, Z., Lu, K., Shi, Z., Wang, B.: A dominance tree and its application in evolutionary multi-objective optimization. In: Information Sciences, pp. 3540–3560 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wei, D., Pan, X., Shi, C., Chen, Y. (2014). A Novel Index Structure for Multi-key Search. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-08010-9_45
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08009-3
Online ISBN: 978-3-319-08010-9
eBook Packages: Computer ScienceComputer Science (R0)