AQAX: a system for approximate XML query answers

  • Authors:
  • Joshua Spiegel;Emmanuel Pontikakis;Suratna Budalakoti;Neoklis Polyzotis

  • Affiliations:
  • Department of Computer Science, University of California Santa Cruz, Santa Cruz, CA;Department of Computer Science, Stanford University, Stanford, CA and UC Santa Cruz;Department of Computer Science, University of California Santa Cruz, Santa Cruz, CA;Department of Computer Science, University of California Santa Cruz, Santa Cruz, CA

  • Venue:
  • VLDB '06 Proceedings of the 32nd international conference on Very large data bases
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

On-line, interactive exploration of large databases becomes prohibitively expensive as the size of the database grows. Approximate query answering offers a cost-effective solution to this problem, by enabling the fast generation of approximate results based on concise data summaries. We apply this paradigm in the context of XML databases, where the increased complexity of data and queries amplifies the challenges behind interactive exploration. We have developed an on-line XML exploration system, termed AQAX that relies on accurate XML summaries in order to enable the rapid exploration of large data sets. To effectively support the exploration of semi-structured query answers, our system employs a tight coupling between the main query processor and the graphical clients that visualize the results. This demonstration will showcase the functionality of our system and the effectiveness of approximate query answering in the context of XML databases.