The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Foundations of programming languages
Foundations of programming languages
Type inference for queries on semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Graph grammars with node-label controlled rewriting and embedding
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
A verifier for interactive, data-driven web applications
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analyzing Conversations of Web Services
IEEE Internet Computing
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Monitoring business processes with queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Exact XML type checking in polynomial time
ICDT'07 Proceedings of the 11th international conference on Database Theory
Querying and monitoring distributed business processes
Proceedings of the VLDB Endowment
Querying web-based applications under models of uncertainty
Proceedings of the VLDB Endowment
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
On models and query languages for probabilistic processes
ACM SIGMOD Record
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
Querying probabilistic business processes for sub-flows
Proceedings of the 14th International Conference on Database Theory
A quest for beauty and wealth (or, business processes for database researchers)
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Type inference and type checking for queries over execution traces
The VLDB Journal — The International Journal on Very Large Data Bases
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe execution traces of business processes (BPs for short). Specifically, we consider here type inference and type checking for queries over BP execution traces. The queries that we consider select portions of the traces that are of interest to the user; the types describe the possible shape of the execution traces in the input/output of the query. We formally define and characterize here three common classes of BP execution traces and their respective notions of type inference and type checking. We study the complexity of the two problems for query languages of varying expressive power and present efficient type inference/checking algorithms whenever possible. Our analysis offers a nearly complete picture of which combinations of trace classes and query features lead to PTIME algorithms and which to NP-complete or undecidable problems.