Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...