Paper Info
Title
Graph queries in a next-generation Datalog system
Abstract
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.
Year
DOI
Venue
2013
10.14778/2536274.2536290
PVLDB
Keywords
Field
DocType
efficient implementation,next-generation datalog system,deductive database systems,rich new set,deductive application language,graph query,powerful new monotonic construct,new generation,special monotonic aggregate,special aggregate,complex graph query
Data mining,Graph,Monotonic function,Graph database,Programming language,Computer science,Theoretical computer science,Deductive database systems,Datalog,Database,Recursion,Semantics of logic
Journal
Volume
Issue
ISSN
6
12
2150-8097
Citations 
PageRank 
References 
18
0.75
11
Authors
3
Name
Order
Citations
PageRank
Alexander Shkapsky1714.86
Kai Zeng237323.16
Carlo Zaniolo343051447.58