The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
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)
A Data Warehouse for Workflow Logs
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Learning Probabilistic Relational Models
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computers in Industry - Special issue: Process/workflow mining
Mining interesting knowledge from weblogs: a survey
Data & Knowledge Engineering
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
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
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Monitoring business processes with queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Representing Tuple and Attribute Uncertainty in Probabilistic Databases
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Dynamic probabilistic relational models
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Many businesses offer their services to customers via Web-based application interfaces. Reasoning about execution flows of such applications is extremely valuable for companies. Such reasoning must often operate under terms of uncertainty and partial information, due to partial tracing, effects of unknown external parameters, and more. The objectives of this research are (1) to define models for capturing Web application executions, with partial information and uncertainly of various flavors, (2) to design algorithms that allow for efficient reasoning over applications/execution traces under these models, and (3) to provide practical implementations that exploit these sound theoretical foundations for effective optimization of Web applications. We identify a restricted class of models that capture realistic scenarios, while allowing for an efficient query-based applications analysis. Hardness results indicate the necessity of such restricted models. We describe these results, highlight open problems, and consider directions for future research.