AQuery: Query language for ordered data, optimization techniques, and experiments

Alberto Lerner, Dennis Shasha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An order-dependent query is one whose result (interpreted as a multiset) changes if the order of the input records is changed. In a stock-quotes database, for instance, retrieving all quotes concerning a given stock for a given day does not depend on order, because the collection of quotes does not depend on order. By contrast, finding a stock's fiveprice moving-average in a trades table gives a result that depends on the order of the table. Query languages based on the relational data model can handle order-dependent queries only through add-ons. SQL:1999, for instance, has a new "window" mechanism which can sort data in limited parts of a query. Add-ons make order-dependent queries difficult to write and to optimize. In this paper we show that order can be a natural property of the underlying data model and algebra. We introduce a new query language and algebra, called AQuery, that supports order from-theground-up. New order-related query transformations arise in this setting. We show by experiment that this framework - language plus optimization techniques - brings orders-ofmagnitude improvement over SQL:1999 systems on many natural order-dependent queries.

Original languageEnglish (US)
Title of host publicationProceedings - 29th International Conference on Very Large Data Bases, VLDB 2003
PublisherMorgan Kaufmann
Pages345-356
Number of pages12
ISBN (Electronic)0127224424, 9780127224428
StatePublished - 2003
Event29th International Conference on Very Large Data Bases, VLDB 2003 - Berlin, Germany
Duration: Sep 9 2003Sep 12 2003

Other

Other29th International Conference on Very Large Data Bases, VLDB 2003
CountryGermany
CityBerlin
Period9/9/039/12/03

Fingerprint

Query languages
Algebra
Data structures
Experiments
Optimization techniques
Query language
Query
Experiment

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Information Systems and Management
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Lerner, A., & Shasha, D. (2003). AQuery: Query language for ordered data, optimization techniques, and experiments. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003 (pp. 345-356). Morgan Kaufmann.

AQuery : Query language for ordered data, optimization techniques, and experiments. / Lerner, Alberto; Shasha, Dennis.

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. p. 345-356.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lerner, A & Shasha, D 2003, AQuery: Query language for ordered data, optimization techniques, and experiments. in Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, pp. 345-356, 29th International Conference on Very Large Data Bases, VLDB 2003, Berlin, Germany, 9/9/03.
Lerner A, Shasha D. AQuery: Query language for ordered data, optimization techniques, and experiments. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann. 2003. p. 345-356
Lerner, Alberto ; Shasha, Dennis. / AQuery : Query language for ordered data, optimization techniques, and experiments. Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. pp. 345-356
@inproceedings{acfba23c839141c1a8d35bb4a80d9837,
title = "AQuery: Query language for ordered data, optimization techniques, and experiments",
abstract = "An order-dependent query is one whose result (interpreted as a multiset) changes if the order of the input records is changed. In a stock-quotes database, for instance, retrieving all quotes concerning a given stock for a given day does not depend on order, because the collection of quotes does not depend on order. By contrast, finding a stock's fiveprice moving-average in a trades table gives a result that depends on the order of the table. Query languages based on the relational data model can handle order-dependent queries only through add-ons. SQL:1999, for instance, has a new {"}window{"} mechanism which can sort data in limited parts of a query. Add-ons make order-dependent queries difficult to write and to optimize. In this paper we show that order can be a natural property of the underlying data model and algebra. We introduce a new query language and algebra, called AQuery, that supports order from-theground-up. New order-related query transformations arise in this setting. We show by experiment that this framework - language plus optimization techniques - brings orders-ofmagnitude improvement over SQL:1999 systems on many natural order-dependent queries.",
author = "Alberto Lerner and Dennis Shasha",
year = "2003",
language = "English (US)",
pages = "345--356",
booktitle = "Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003",
publisher = "Morgan Kaufmann",

}

TY - GEN

T1 - AQuery

T2 - Query language for ordered data, optimization techniques, and experiments

AU - Lerner, Alberto

AU - Shasha, Dennis

PY - 2003

Y1 - 2003

N2 - An order-dependent query is one whose result (interpreted as a multiset) changes if the order of the input records is changed. In a stock-quotes database, for instance, retrieving all quotes concerning a given stock for a given day does not depend on order, because the collection of quotes does not depend on order. By contrast, finding a stock's fiveprice moving-average in a trades table gives a result that depends on the order of the table. Query languages based on the relational data model can handle order-dependent queries only through add-ons. SQL:1999, for instance, has a new "window" mechanism which can sort data in limited parts of a query. Add-ons make order-dependent queries difficult to write and to optimize. In this paper we show that order can be a natural property of the underlying data model and algebra. We introduce a new query language and algebra, called AQuery, that supports order from-theground-up. New order-related query transformations arise in this setting. We show by experiment that this framework - language plus optimization techniques - brings orders-ofmagnitude improvement over SQL:1999 systems on many natural order-dependent queries.

AB - An order-dependent query is one whose result (interpreted as a multiset) changes if the order of the input records is changed. In a stock-quotes database, for instance, retrieving all quotes concerning a given stock for a given day does not depend on order, because the collection of quotes does not depend on order. By contrast, finding a stock's fiveprice moving-average in a trades table gives a result that depends on the order of the table. Query languages based on the relational data model can handle order-dependent queries only through add-ons. SQL:1999, for instance, has a new "window" mechanism which can sort data in limited parts of a query. Add-ons make order-dependent queries difficult to write and to optimize. In this paper we show that order can be a natural property of the underlying data model and algebra. We introduce a new query language and algebra, called AQuery, that supports order from-theground-up. New order-related query transformations arise in this setting. We show by experiment that this framework - language plus optimization techniques - brings orders-ofmagnitude improvement over SQL:1999 systems on many natural order-dependent queries.

UR - http://www.scopus.com/inward/record.url?scp=85012124676&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85012124676&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85012124676

SP - 345

EP - 356

BT - Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

PB - Morgan Kaufmann

ER -