Abstract
This paper mainly explores the design of the multiple key hashing file (MKHF) for orthogonal range retrieval. First, we show the optimal MKHF design problem for orthogonal range queries (ORQs) is NP-hard. Then the performance formula of the MKHF over all possible ORQs is derived. We also present a theoretical lower bound on the performance of the MKHF over all possible ORQs. Finally, a very interesting phenomenon existing in the optimal orthogonal range information retrieval system and the optimal partial match information retrieval system is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
