Advertisement

Categorizing Operators

  • Deepak PEmail author
  • Prasad M. Deshpande
Chapter
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Abstract

We consider categorization of similarity operators to aid easy positioning and assimilation of the semantics of different operators. The first classification puts operators in one of two classes based on whether it produces ordered or unordered result sets, whereas the second considers the usage of attributes in the operator-specific similarity representations for an object. We consider the implications of each of these choices and give examples of operators that fall into each of these four classes. We then look at features; a set of tools that are available for the designer of any search system to add to operators to tune the system to specific search needs. We outline the semantics of the result set transformation under each of these features, illustrate motivating scenarios for the usage of such features, and list operators from literature that have made use of them. Through such a discussion of categorization of operators, and features that could be used along with operators, we provide the interested reader with mental tools for quickly positioning operators with respect to the categories and the features they employ.

Keywords

Range Query Skyline Query Query Object Skyline Operator VLDB Endowment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. L. Clarke, M. Kolla, G. V. Cormack, O. Vechtomova, A. Ashkan, S. Büttcher, and I. MacKinnon. Novelty and diversity in information retrieval evaluation. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 659–666. ACM, 2008.Google Scholar
  2. 2.
    E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In Proceedings of the 33rd international conference on Very large data bases, pages 291–302. VLDB Endowment, 2007.Google Scholar
  3. 3.
    P. M. Deshpande, P. Deepak, and K. Kummamuru. Efficient online top-k retrieval with arbitrary similarity measures. In Proceedings of the 11th international conference on Extending database technology: Advances in database technology, pages 356–367. ACM, 2008.Google Scholar
  4. 4.
    T. Emrich, M. Franzke, N. Mamoulis, M. Renz, and A. Züfle. Geo-social skyline queries. In Database Systems for Advanced Applications, pages 77–91. Springer, 2014.Google Scholar
  5. 5.
    R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 66(4):614–656, 2003.Google Scholar
  6. 6.
    Y. Gao, B. Zheng, G. Chen,W.-C. Lee, K. C. Lee, and Q. Li. Visible reverse k-nearest neighbor queries. In Data Engineering, 2009. ICDE’09. IEEE 25th International Conference on, pages 1203–1206. IEEE, 2009.Google Scholar
  7. 7.
    A. Jain, P. Sarda, and J. R. Haritsa. Providing diversity in k-nearest neighbor query results. In Advances in Knowledge Discovery and Data Mining, pages 404–413. Springer, 2004.Google Scholar
  8. 8.
    F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In ACM SIGMOD Record, volume 29, pages 201–212. ACM, 2000.Google Scholar
  9. 9.
    Y. Kumar, R. Janardan, and P. Gupta. Efficient algorithms for reverse proximity query problems. In Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, page 39. ACM, 2008.Google Scholar
  10. 10.
    X. Lian and L. Chen. Monochromatic and bichromatic reverse skyline search over uncertain databases. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 213–226. ACM, 2008.Google Scholar
  11. 11.
    X. Lian and L. Chen. Similarity search in arbitrary subspaces under l p-norm. In Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on, pages 317–326. IEEE, 2008.Google Scholar
  12. 12.
    X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang. Selecting stars: The k most representative skylineoperator. In Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on, pages 86–95. IEEE, 2007.Google Scholar
  13. 13.
    Q. Liu, Y. Gao, G. Chen, Q. Li, and T. Jiang. On efficient reverse k-skyband query processing. In Database Systems for Advanced Applications, pages 544–559. Springer, 2012.Google Scholar
  14. 14.
    S. Nutanong, E. Tanin, and R. Zhang. Visible nearest neighbor queries. In Advances in Databases: Concepts, Systems and Applications, pages 876–883. Springer, 2007.Google Scholar
  15. 15.
    D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive skyline computation in database systems. ACM Transactions on Database Systems (TODS), 30(1):41–82, 2005.Google Scholar
  16. 16.
    M. Sharifzadeh and C. Shahabi. The spatial skyline queries. In Proceedings of the 32nd international conference on Very large data bases, pages 751–762. VLDB Endowment, 2006.Google Scholar
  17. 17.
    Y. Shi and B. Graham. A similarity search approach to solving the multi-query problems. In Computer and Information Science (ICIS), 2012 IEEE/ACIS 11th International Conference on, pages 237–242. IEEE, 2012.Google Scholar
  18. 18.
    Y. Tao, D. Papadias, and X. Lian. Reverse knn search in arbitrary dimensionality. In Proceedings of the Thirtieth international conference on Very large data bases-Volume 30, pages 744–755. VLDB Endowment, 2004.Google Scholar
  19. 19.
    Y. Tao, X. Xiao, and J. Pei. Efficient skyline and top-k retrieval in subspaces. Knowledge and Data Engineering, IEEE Transactions on, 19(8):1072–1088, 2007.Google Scholar
  20. 20.
    Q. T. Tran, D. Taniar, and M. Safar. Bichromatic reverse nearest-neighbor search in mobile systems. Systems Journal, IEEE, 4(2):230–242, 2010.Google Scholar
  21. 21.
    A. K. Tung, R. Zhang, N. Koudas, and B. C. Ooi. Similarity search: a matching based approach. In Proceedings of the 32nd international conference on Very large data bases, pages 631–642. VLDB Endowment, 2006.Google Scholar
  22. 22.
    A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag. Monochromatic and bichromatic reverse top-k queries. Knowledge and Data Engineering, IEEE Transactions on, 23(8):1215–1229, 2011.Google Scholar
  23. 23.
    W. Wu, F. Yang, C.-Y. Chan, and K.-L. Tan. Finch: Evaluating reverse k-nearest-neighbor queries on location data. Proceedings of the VLDB Endowment, 1(1):1056–1067, 2008.Google Scholar
  24. 24.
    M. L. Yiu and N. Mamoulis. Reverse nearest neighbors search in ad hoc subspaces. Knowledge and Data Engineering, IEEE Transactions on, 19(3):412–426, 2007.Google Scholar
  25. 25.
    Z. Zhang, C. Jin, and Q. Kang. Reverse k-ranks query. Proceedings of the VLDB Endowment, 7(10), 2014.Google Scholar

Copyright information

© The Author(s) 2015

Authors and Affiliations

  1. 1.IBM ResearchBangaloreIndia

Personalised recommendations