Query Evaluation With Constant Delay
نویسنده
چکیده
Databases: storage of data and retrieval of information.
منابع مشابه
Answering UCQs under Updates and in the Presence of Integrity Constraints
We investigate the query evaluation problem for fixed queries over fully dynamic databases where tuples can be inserted or deleted. The task is to design a dynamic data structure that can immediately report the new result of a fixed query after every database update. We consider unions of conjunctive queries (UCQs) and focus on the query evaluation tasks testing (decide whether an input tuple a...
متن کاملConstant Delay Enumeration for Acyclic Conjunctive Queries over X Structures
We present an efficient answer enumeration algorithm for an extension of Conditional XPath with variables, which is a first-order complete query language for unranked trees of bounded depth. Our algorithm requires constant delay and linear preprocessing time for fixed queries, while depending linearly on the size of the query. It is based on a new enumeration algorithm for disjunctions of acycl...
متن کاملOn Acyclic Conjunctive Queries and Constant Delay Enumeration
We study the enumeration complexity of the natural extension of acyclic conjunctive queries with disequalities. In this language, a number of NP-complete problems can be expressed. We first improve a previous result of Papadimitriou and Yannakakis by proving that such queries can be computed in time c.|M|.|φ(M)| where M is the structure, φ(M) is the result set of the query and c is a simple exp...
متن کاملSemantics and Complexity of GraphQL
GraphQL is a recently proposed, and increasingly adopted, conceptual framework for providing a new type of data access interface on the Web. The framework includes a new graph query language whose semantics has been specified informally only. This has prevented the formal study of the main properties of the language. We embark on the formalization and study of GraphQL. To this end, we first for...
متن کاملUsing Locality for Efficient Query Evaluation in Various Computation Models (Invited Talk)
In the database theory and logic literature, different notions of locality of queries have been studied, the most prominent being Hanf locality [6, 4, 12] and Gaifman locality [5, 8]. These notions are designed so that, in order to evaluate a local query in a given database, it suffices to look only at small neighbourhoods around tuples of elements that belong to the database. In this talk I wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013