Many applications require efficient management of large sets of intervals because many
objects are associated with intervals (eg, time and price intervals). In such interval …

In this work, we present a collection of new results on two fundamental problems in
geometric data structures: orthogonal point location and rectangle stabbing.-We give the first …

Let D be a set of n elements each associated with a real-valued weight, and Q be the set of
all possible predicates allowed on those elements. Given a predicate in Q and integer k, a …

Orthogonal range reporting (ORR) is a classic problem in computational geometry and
databases, where the objective is to preprocess a set P of points in R 2 such that, given an …

Many applications require efficient management of large sets of intervals because many
objects are associated with intervals (eg, time and price intervals). In such interval …

Packet classification plays a crucial role in numerous network services, including Quality of
Service (QoS), Firewalls, and data streaming. In our research, we introduce a cutting-edge …

Top-k search, which reports the k elements of the highest importance from all the elements
in an underlying dataset that satisfy a certain predicate, has attracted significant attention …

A reporting query returns the objects satisfying a predicate q from an input set. In prioritized
reporting, each object carries a real-valued weight (which can be query dependent), and a …

With its simple principles to achieve parallelism and fault tolerance, the Map-reduce
framework has captured wide attention, from traditional high performance computing to …

In this paper, we focus on the problem of massive data retrieval, which is of great importance
in data management and searching. To enhance the effectiveness of massive data retrieval …