research-article

Answering top-k queries over a mixture of attractive and repulsive dimensions

Authors:

Ambuj K. SinghAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 5, Issue 3

Pages 169 - 180

https://doi.org/10.14778/2078331.2078333

Published: 01 November 2011 Publication History

Abstract

In this paper, we formulate a top-k query that compares objects in a database to a user-provided query object on a novel scoring function. The proposed scoring function combines the idea of attractive and repulsive dimensions into a general framework to overcome the weakness of traditional distance or similarity measures. We study the properties of the proposed class of scoring functions and develop efficient and scalable index structures that index the isolines of the function. We demonstrate various scenarios where the query finds application. Empirical evaluation demonstrates a performance gain of one to two orders of magnitude on querying time over existing state-of-the-art top-k techniques. Further, a qualitative analysis is performed on a real dataset to highlight the potential of the proposed query in discovering hidden data characteristics.

References

[1]

J. Barnard, G. Downs, and P. Willett. Descriptor-Based Similarity Measures for Screening Chemical Databases, pages 59--80. John Wiley & Sons, 2000.

[2]

S. Berchtold, D. A. Keim, and H. peter Kriegel. The x-tree: An index structure for high-dimensional data. In Very Large Data Bases, pages 28--39, 1996.

[3]

Y.-C. Chang, L. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J. R. Smith. The onion technique: indexing for linear optimization queries. In SIGMOD, pages 391--402, 2000.

[4]

G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis. Answering top-k queries using views. In VLDB, pages 451--462, 2006.

[5]

Daylight Chemical Information Systems Inc. Daylight Theory Manual.

[6]

M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000.

[7]

R. Fagin. Combining fuzzy information from multiple systems. In Symposium on Principles of Database Systems, pages 216--226, 1996.

[8]

R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102--113, 2001.

[9]

U. Güntzer, W.-T. Balke, and W. KieSSling. Optimizing multi-feature queries for image databases. In VLDB, pages 419--428, 2000.

[10]

V. Hristidis, N. Koudas, and Y. Papakonstantinou. Prefer: a system for the efficient execution of multi-parametric ranked queries. In SIGMOD, pages 259--270, 2001.

[11]

C. A. Lipinski, F. Lombardo, B. W. Dominy, and P. J. Feeney. Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings. Adv Drug Deliv Rev, 46(1--3):3--26, 2001.

[12]

S. Nepal and M. Ramakrishna. Query processing issues in image(multimedia) databases. In ICDE, pages 22--29, 1999.

[13]

S. Ranu and A. K. Singh. Mining statistically significant molecular substructures for efficient molecular classification. Journal of Chemical Information Modeling, 49:2537--2550, 2009.

[14]

S. Ranu and A. K. Singh. Novel method for pharmacophore analysis by examining the joint pharmacophore space. Journal of Chemical Information and Modeling, 51(5):1106--1121, 2011.

[15]

Y. Tao, D. Papadias, V. Hristidis, and Y. Papakonstantinou. Branch-and-bound processing of ranked queries. Information Systems, 32:424--445, 2007.

[16]

D. F. Veber, S. R. Johnson, H.-Y. Y. Cheng, B. R. Smith, K. W. Ward, and K. D. Kopple. Molecular properties that influence the oral bioavailability of drug candidates. Journal of Medicinal Chemistry, 45(12):2615--2623, 2002.

[17]

A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag. Reverse top-k queries. In ICDE, pages 365--376, 2010.

[18]

D. Xin, C. Chen, and J. Han. Towards robust indexing for ranked queries. In VLDB, pages 235--246, 2006.

[19]

D. Xin, J. Han, and K. C. chuan Chang. Progressive and selective merge: computing top-k with ad-hoc ranking functions. In SIGMOD, pages 103--114, 2007.

[20]

L. Zou and L. Chen. Dominant graph: An efficient indexing structure to answer top-k queries. In ICDE, pages 536--545, 2008.

Cited By

Zhu LLiu FMeng WMa QWang YYuan F(2016)Evaluating Top-N queries in n-dimensional normed spacesInformation Sciences: an International Journal10.1016/j.ins.2016.09.035374:C(255-275)Online publication date: 20-Dec-2016
https://dl.acm.org/doi/10.1016/j.ins.2016.09.035
Ranu SHoang MSingh A(2014)Applications of Top-k Representative QueriesProceedings of Semantic Web Information Management on Semantic Web Information Management10.1145/2630602.2630609(1-2)Online publication date: 21-Jun-2014
https://dl.acm.org/doi/10.1145/2630602.2630609
Ranu SHoang MSingh ADyreson CLi FÖzsu M(2014)Answering top-k representative queries on graph databasesProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2610524(1163-1174)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2610524
Show More Cited By

Answering top-k queries over a mixture of attractive and repulsive dimensions
1. Information systems
  1. Information retrieval
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Answering top-k queries using views
VLDB '06: Proceedings of the 32nd international conference on Very large data bases

The problem of obtaining efficient answers to top-k queries has attracted a lot of research attention. Several algorithms and numerous variants of the top-k retrieval problem have been introduced in recent years. The general form of this problem ...
Answering why-not and why questions on reverse top-k queries

Why-not and why questions can be posed by database users to seek clarifications on unexpected query results. Specifically, why-not questions aim to explain why certain expected tuples are absent from the query results, while why questions try to clarify ...
Answering Why-not Questions on Top-k Queries
ICDE '12: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering

After decades of effort working on database performance, the quality and the usability of database systems have received more attention in recent years. In particular, the feature of explaining missing tuples in a query result, or the so-called "why-not"...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 5, Issue 3

November 2011

117 pages

ISSN:2150-8097

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 November 2011

Published in PVLDB Volume 5, Issue 3

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
134
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhu LLiu FMeng WMa QWang YYuan F(2016)Evaluating Top-N queries in n-dimensional normed spacesInformation Sciences: an International Journal10.1016/j.ins.2016.09.035374:C(255-275)Online publication date: 20-Dec-2016
https://dl.acm.org/doi/10.1016/j.ins.2016.09.035
Ranu SHoang MSingh A(2014)Applications of Top-k Representative QueriesProceedings of Semantic Web Information Management on Semantic Web Information Management10.1145/2630602.2630609(1-2)Online publication date: 21-Jun-2014
https://dl.acm.org/doi/10.1145/2630602.2630609
Ranu SHoang MSingh ADyreson CLi FÖzsu M(2014)Answering top-k representative queries on graph databasesProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2610524(1163-1174)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2610524
Madrid NStraccia U(2013)On Top-k Retrieval for a Family of Non-monotonic Ranking FunctionsProceedings of the 10th International Conference on Flexible Query Answering Systems - Volume 813210.1007/978-3-642-40769-7_44(507-518)Online publication date: 18-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-40769-7_44
Chester SThomo AVenkatesh SWhitesides S(2013)Indexing Reverse Top-k Queries in Two DimensionsDatabase Systems for Advanced Applications10.1007/978-3-642-37487-6_17(201-208)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37487-6_17
Sahpaski DDimovski AVelinov GKon-Popovska M(2012)Efficient processing of top-k join queries by attribute domain refinementProceedings of the 16th East European conference on Advances in Databases and Information Systems10.1007/978-3-642-33074-2_24(318-331)Online publication date: 18-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33074-2_24
Madrid NRusnok P(undefined)Verification of Top-K Algorithm for a Family of Non-monotonic Ranking Functions2015 IEEE International Conference on Systems, Man, and Cybernetics10.1109/SMC.2015.462(2643-2648)
https://dl.acm.org/doi/10.1109/SMC.2015.462

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents