Demand-Driven Incremental Object Queries release_exn33zrevnhbtoduz4ejh2nfyu

by Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin

Released as a article .

2015  

Abstract

Object queries are essential in information seeking and decision making in vast areas of applications. However, a query may involve complex conditions on objects and sets, which can be arbitrarily nested and aliased. The objects and sets involved as well as the demand---the given parameter values of interest---can change arbitrarily. How to implement object queries efficiently under all possible updates, and furthermore to provide complexity guarantees? This paper describes an automatic method. The method allows powerful queries to be written completely declaratively. It transforms demand as well as all objects and sets into relations. Most importantly, it defines invariants for not only the query results, but also all auxiliary values about the objects and sets involved, including those for propagating demand, and incrementally maintains all of them. Implementation and experiments with problems from a variety of application areas, including distributed algorithms and probabilistic queries, confirm the analyzed complexities, trade-offs, and significant improvements over prior work.
In text/plain format

Archived Files and Locations

application/pdf  516.8 kB
file_n4f6aukuz5cm7ms426lpgoiyhi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-11-25
Version   v2
Language   en ?
arXiv  1511.04583v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 53ed28ae-a310-453e-9d4f-e01f4e098cdf
API URL: JSON