Online dynamic reordering

  • Authors:

  • Vijayshankar Raman;Bhaskaran Raman;Joseph M. Hellerstein

  • Affiliations:

  • University of California, Berkeley, Computer Science Division, Berkeley, CA 94720-1776, USA/ E-mail: {rshankar,bhaskar,jmh}@cs.berkeley.edu;University of California, Berkeley, Computer Science Division, Berkeley, CA 94720-1776, USA/ E-mail: {rshankar,bhaskar,jmh}@cs.berkeley.edu;University of California, Berkeley, Computer Science Division, Berkeley, CA 94720-1776, USA/ E-mail: {rshankar,bhaskar,jmh}@cs.berkeley.edu

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a pipelining, dynamically tunable reorder operator for providing user control during long running, data- intensive operations. Users can see partial results and accordingly direct the processing by specifying preferences for various data items; data of interest is prioritized for early processing. The reordering mechanism is efficient and non-blocking and can be used over arbitrary data streams from files and indexes, as well as continuous data feeds. We also investigate several policies for the reordering based on the performance goals of various typical applications. We present performance results for reordering in the context of an online aggregation implementation in Informix and in the context of sorting and scrolling in a large-scale spreadsheet. Our experiments demonstrate that for a variety of data distributions and applications, reordering is responsive to dynamic preference changes, imposes minimal overheads in overall completion time, and provides dramatic improvements in the quality of the feedback over time. Surprisingly, preliminary experiments indicate that online reordering can also be useful in traditional batch query processing, because it can serve as a form of pipelined, approximate sorting.