Evaluating mid-(k, n) queries using b+-tree

Authors:
Dongseop Kwon;Taewon Lee;Sukho Lee
Affiliations:
School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea
Venue:
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Year:
2005

Citing 8
Cited 0

Approximate medians and other quantiles in one pass and with limited memory

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Reducing the Braking Distance of an SQL Query Engine

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Evaluating Top-k Selection Queries

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Probabilistic Optimization of Top N Queries

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Sampling-Based Estimator for Top-k Query

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Time bounds for selection

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional database systems assume that clients always consume the results of queries from the beginning. In various new applications especially in WWW, however, clients frequently need a small part of the result from the middle, e.g. retrieving a page in a bulletin board in WWW. To process this partial retrieval, traditional database systems should find all the records and discard unnecessary ones. Although several algorithms for top-k queries have been proposed, there has been no research effort for partial retrieving from the middle of an ordered result. In this paper, we define a mid-(k,n) query, which retrieves n records from the kth record of an ordered result. We also propose an efficient algorithm for mid-(k,n) queries using a slightly modified B+-Tree, named the B+c-Tree. We provide the theoretical analysis and the experimental results that the proposed technique evaluates mid-(k,n) queries efficiently.