Querying complex graphs

Authors:
Yanhong A. Liu;Scott D. Stoller
Affiliations:
Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY;Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY
Venue:
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Year:
2006

Citing 26
Cited 6

Cesar: a static sequencing constraint analyzer

TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Logic programming and databases

Logic programming and databases
On the power of magic

Journal of Logic Programming
Querying object-oriented databases

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
XSB as a deductive database

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Efficient implementation of adaptive software

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
Trace-based program analysis

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular path queries with constraints

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query containment for conjunctive queries with regular expressions

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Unified Approach to Path Problems

Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Transforming the .NET intermediate language using path logic programming

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Universal Regular Path Queries

Higher-Order and Symbolic Computation
Querying Semi-Structured Data

ICDT '97 Proceedings of the 6th International Conference on Database Theory
CORAL - Control, Relations and Logic

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Solving Regular Path Queries

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
From datalog rules to efficient programs with time and space guarantees

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Reasoning on regular path queries

ACM SIGMOD Record
Traversals of object structures: Specification and Efficient Implementation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric regular path queries

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Conditional XPath, the first order complete XPath dialect

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Synthesizing fast intrusion prevention/detection systems from high-level specifications

SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8

JunGL: a scripting language for refactoring

Proceedings of the 28th international conference on Software engineering
Generating Specialized Rules and Programs for Demand-Driven Analysis

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
From datalog rules to efficient programs with time and space guarantees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph queries through datalog optimizations

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Using design metrics for predicting system flexibility

FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Query languages for graph databases

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a powerful language for querying complex graphs and a method for generating efficient implementations that can answer queries with complexity guarantees. The graphs may have edge labels that may have parameters, and easily and naturally capture complex interrelated objects in object-oriented systems and XML data. The language is built on extended regular path expressions with variables and scoping, and can express queries more easily and clearly than previous query languages.The method for implementation first transforms queries into Datalog with limited extensions. It then extends a previous method to generate specialized algorithms and complexity formulas from Datalog with these extensions.