DocumentCode
2655870
Title
Two dimensional Range Minimum/Maximum Query revisited
Author
Crochemore, Maxime ; Hasan, Masud ; Moosa, Tanaeem M. ; Rahman, M. Sohel
Author_Institution
Dept. of Comput. Sci., King´´s Coll. London, London, UK
fYear
2010
fDate
23-25 Dec. 2010
Firstpage
27
Lastpage
32
Abstract
In this paper, we present a cache oblivious efficient data structure to solve the two dimensional variant of the Range Minimum/Maximum Query (RMQ) problem.
Keywords
cache storage; data structures; query processing; cache complexity; data structure; range minimum-maximum query; Algorithm design and analysis; Arrays; Complexity theory; Computational modeling; Computer science; Partitioning algorithms; Cache Complexity; Range Minima/Maxima Query.A; Range Minima/Maxima Query.lgorithms; lgorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (ICCIT), 2010 13th International Conference on
Conference_Location
Dhaka
Print_ISBN
978-1-4244-8496-6
Type
conf
DOI
10.1109/ICCITECHN.2010.5723824
Filename
5723824
Link To Document