Efficient processing of conical queries

@inproceedings{Ferhatosmanoglu2001EfficientPO,
  title={Efficient processing of conical queries},
  author={H. Ferhatosmanoglu and D. Agrawal and A. Abbadi},
  booktitle={CIKM '01},
  year={2001}
}
  • H. Ferhatosmanoglu, D. Agrawal, A. Abbadi
  • Published in CIKM '01 2001
  • Computer Science
  • 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Efficient Evaluation of Radial Queries using the Target Tree
    3
    Efficient Evaluation of Radial Queries using the Target Tree
    1
    Query support for multi-dimensional and dynamic databases
    A geometrical solution to time series searching invariant to shifting and scaling
    2
    A geometrical solution to time series searching invariant to shifting and scaling
    7
    A geometrical solution to time series searching invariant to shifting and scaling
    2
    A geometrical solution to time series searching invariant to shifting and scaling
    7
    Efficient Evaluation of Radial Queries using the Target Tree
    3
    Query support for multi-dimensional and dynamic databases

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 31 REFERENCES

    Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

    To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=502587.