Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions

Details Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions

2011-11-30

arxiv.org/abs/1111.7165v1

Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 3, pp. 169-180 (2011)

Computer Science

Databases

VLDB2012

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8568