The expressive power of stratified logic programs
Information and Computation
Advanced database systems
The Magic of Duplicates and Aggregates
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The deductive database system ℒ𝒟ℒ++
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Communications of the ACM - Scratch Programming for All
Datalog redux: experience and conjecture
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Map-reduce extensions and recursive queries
Proceedings of the 14th International Conference on Extending Database Technology
A rule-based language for web data management
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ontological queries: Rewriting and optimization
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Proceedings of the Second international conference on Datalog in Academia and Industry
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
LogicBlox, platform and language: a tutorial
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Logical foundations of continuous query languages for data streams
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Extending the power of datalog recursion
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Recent theoretical advances have enabled the use of special monotonic aggregates in recursion. These special aggregates make possible the concise expression and efficient implementation of a rich new set of advanced applications. Among these applications, graph queries are particularly important because of their pervasiveness in data intensive application areas. In this demonstration, we present our Deductive Application Language (DeAL) System, the first of a new generation of Deductive Database Systems that support applications that could not be expressed using regular stratification, or could be expressed using XY-stratification (also supported in DeAL) but suffer from inefficient execution. Using example queries, we will (i) show how complex graph queries can be concisely expressed using DeAL and (ii) illustrate the formal semantics and efficient implementation of these powerful new monotonic constructs.