Efficient Processing of Conical Queries

Conical queries are a novel type of query with an increasing number ofapplications. Traditional index structures and retrieval mechanisms,in general, have been optimized for rectangular and circular queries,rather than conical queries. In this paper, we focus on conicalqueries which can be defined as a multi-dimensional cone in amulti-dimensional data space. We develop a model for expressing suchqueries and suggest efficient techniques for evaluating them. Inparticular, we explore the retrieval problem in the context of conicalquery processing and develop multi-disk allocation methodsspecifically for processing conical queries.