Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Journal of Logic Programming
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Well-structured transition systems everywhere!
Theoretical Computer Science
Problem of Incomplete Information in Relational Databases
Problem of Incomplete Information in Relational Databases
The relational model of data and cylindrical algebras
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Lazy query evaluation for Active XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Inventory Decisions in Dell's Supply Chain
Interfaces
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Representing and querying XML with incomplete information
ACM Transactions on Database Systems (TODS)
User-friendly functional programming for web mashups
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Distributed monitoring of peer to peer systems
Proceedings of the 9th annual ACM international workshop on Web information and data management
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Active XML project: an overview
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Querying Data under Access Limitations
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distributed Monitoring of Peer-to-Peer Systems
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Conjunctive query containment over trees
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On the equivalence of distributed systems with queries and communication
Proceedings of the 14th International Conference on Database Theory
Determining relevance of accesses at runtime
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the equivalence of distributed systems with queries and communication
Journal of Computer and System Sciences
Hi-index | 0.00 |
ManyWeb applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems [22] or when monitoring distributed autonomous systems [6]. This is a challenging problem that has generated recently a lot of attention; see Web 2.0 [38]. For capturing interactions between Web components, we use active documents interacting with the rest of the world via streams of updates. Their input streams specify updates to the document (in the spirit of RSS feeds), whereas their output streams are defined by queries on the document. In most of the paper, the focus is on input streams where the updates are only insertions, although we do consider also deletions. We introduce and study two fundamental concepts in this setting, namely, satisfiability and relevance. Some fact is satisfiable for an active document and a query if it has a chance to be in the result of the query in some future state. Given an active document and a query, a call in the document is relevant if the data brought by this call has a chance to impact the answer to the query. We analyze the complexity of computing satisfiability in our core model (insertions only) and for extensions (e.g., with deletions). We also analyze the complexity of computing relevance in the core model.