Efficient processing of conical queries

Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Conical queries are a novel type of query with an increasing number of applications. 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 conical queries which can be defined as a multi-dimensional cone in a multi-dimensional data space. We develop a model for expressing such queries and suggest efficient techniques for evaluating them. In particular, we explore the retrieval problem in the context of conical query processing and develop multi-disk allocation methods specifically for processing conical queries.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
EditorsH. Paques, L. Liu
Pages1-8
Number of pages8
Publication statusPublished - 1 Dec 2001
Externally publishedYes
EventProceedings of the 2001 ACM CIKM: 10th International Conference on Information and Knowledge Management - Atlanta, GA, United States
Duration: 5 Nov 200110 Nov 2001

Other

OtherProceedings of the 2001 ACM CIKM: 10th International Conference on Information and Knowledge Management
CountryUnited States
CityAtlanta, GA
Period5/11/0110/11/01

    Fingerprint

ASJC Scopus subject areas

  • Business, Management and Accounting(all)

Cite this

Ferhatosmanoglu, H., Agrawal, D., & El Abbadi, A. (2001). Efficient processing of conical queries. In H. Paques, & L. Liu (Eds.), International Conference on Information and Knowledge Management, Proceedings (pp. 1-8)