Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Evaluating Mid-(k, n) Queries Using B + -Tree
verfasst von : Dongseop Kwon, Taewon Lee, Sukho Lee
Erschienen in: Database and Expert Systems Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
k
th
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.