Filters








46,024 Hits in 3.4 sec

Regular path queries with constraints

Serge Abiteboul, Victor Vianu
1997 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97  
The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries.  ...  The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered.  ...  Regular Path Queries We next recall the notion of regular path query.  ... 
doi:10.1145/263661.263676 dblp:conf/pods/AbiteboulV97 fatcat:ur4y3vrwevdm3p3dz2c6dgpsee

Regular Path Queries with Constraints

Serge Abiteboul, Victor Vianu
1999 Journal of computer and system sciences (Print)  
The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries.  ...  The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered.  ...  Regular Path Queries We next recall the notion of regular path query.  ... 
doi:10.1006/jcss.1999.1627 fatcat:iojdp3lyebfv3mvynvjkwfmq3u

Modular Path Queries with Arithmetic

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2021 Logical Methods in Computer Science  
A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria.  ...  We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity.  ...  In PR, we define them using conjunctions of regular constraints. Regular constraints extend the formalism of Regular Path Queries (RPQs) to deal with the values of labelling functions.  ... 
doi:10.46298/lmcs-17(3:27)2021 fatcat:zu3e4yiv5jecpktc52foici4xi

Modular Path Queries with Arithmetic [article]

Jakub Michaliszyn and Jan Otop and Piotr Wieczorek
2021 arXiv   pre-print
A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria.  ...  We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity.  ...  In PR, we define them using conjunctions of regular constraints. Regular constraints extend the formalism of Regular Path Queries (RPQs) to deal with the values of labelling functions.  ... 
arXiv:2002.04460v5 fatcat:cy44rb2gcnhgll4h5tfi6lnzta

Query containment and rewriting using views for regular path queries under constraints

Gösta Grahne, Alex Thomo
2003 Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '03  
We investigate the containment of regular path queries under general path constraints.  ...  Based on the query containment under constraints, we reason about constrained rewritings -using views-of regular path queries.  ...  Such partial query/view evaluations usually occur when dealing with regular path atoms of conjunctive regular path queries. A formal algorithm for this case is given in [16] .  ... 
doi:10.1145/773153.773165 dblp:conf/pods/GrahneT03 fatcat:2t23wwjkfjdtvjqfrd6rplueuy

Querying Complex Graphs [chapter]

Yanhong A. Liu, Scott D. Stoller
2005 Lecture Notes in Computer Science  
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.  ...  Michael Kifer for references to related work in database research, for helpful explanations and discussions, and for their inspiring work on querying object-oriented and deductive databases.  ... 
doi:10.1007/11603023_14 fatcat:rppobsf5gfblpm43bv66s5hd6m

Extraction and Implication of Path Constraints [chapter]

Yves André, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
2004 Lecture Notes in Computer Science  
Then, we give a new decision algorithm for the implication problem of a constraint p q by a set of constraints pi ui where p, q, and the pi's are regular path expressions and the ui's are non empty paths  ...  We consider semistructured data as rooted edge-labeled directed graphs, and path inclusion constraints on these graphs.  ...  In particular, a regular path expression or regular query is a regular expression on the alphabet of labels appearing in the data.  ... 
doi:10.1007/978-3-540-28629-5_68 fatcat:tk3j4dytfjg27pctrhjfq3hm6a

Manipulations of Graphs with a Visual Query Language: Application to a Geographical Information System [chapter]

Anne Brossier-Wansek, Michel Mainguenaud
1995 Visual Database Systems 3  
In this paper we present network manipulations with a visual query language for a geographical database. A query is defined with a visual expression defined with a Query-By-Example approach.  ...  Keyword Visual query language, Graph manipulations, Geographical Information System S. Spaccapietra et al. (eds.), Visual Database Systems 3  ...  Query Q2 requires the computation of a path operator in graph G with constraints on edges.  ... 
doi:10.1007/978-0-387-34905-3_16 fatcat:y6e757ruobddpo7fmdlnvpuuzi

Constrained regular expressions for answering RDF-path queries modulo RDFS

Faisal Alkhateeb, Jerome Euzenat
2014 International Journal of Web Information Systems  
In this paper, we discuss extensions of SPARQL that use regular expressions to navigate RDF graphs and may be used to answer queries considering RDFS semantics.  ...  The standard SPARQL query language is currently defined for querying RDF graphs without RDFS semantics. Several extensions of SPARQL to RDFS semantics have been proposed.  ...  In particular, the CPSPARQL prototype shows that queries with constraints are answered faster than the same queries without constraints.  ... 
doi:10.1108/ijwis-05-2013-0013 fatcat:qudamqe2wrdj7bomftwmh7z3ta

Path constraints in semistructured data

Y. André, A.C. Caron, D. Debarbieux, Y. Roos, S. Tison
2007 Theoretical Computer Science  
A path inclusion constraint p q is satisfied by a semistructured data if any node reached by the regular query p is also reached by the regular query q.  ...  -We give a new decision algorithm for the implication problem of a constraint p q by a set of bounded path constraints p i u i where p, q, and the p i 's are regular path expressions and the u i 's are  ...  More generally, when p is a regular path query and u is a word, the constraint p u is called bounded path inclusion.  ... 
doi:10.1016/j.tcs.2007.05.010 fatcat:evv7mdtvtbh6njpylhuy3pttum

Querying Best Paths in Graph Databases [article]

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
2017 arXiv   pre-print
Querying graph databases has recently received much attention.  ...  A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria.  ...  We presented examples of natural properties and OPRA queries expressing them in an organized, modular way. We showed that OPRA strictly subsumes query languages ECRPQ+LC and LARE.  ... 
arXiv:1710.04419v1 fatcat:6yuadecg7bhapnv7eihph2vqfu

Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model [chapter]

Peter Buneman, Wenfei Fan, Scott Weinstein
2000 Lecture Notes in Computer Science  
This paper investigates path constraints for the deterministic data model. It demonstrates the application of path constraints to, among other things, query optimization.  ...  , denoted by P c , by representing paths as regular expressions.  ...  The approach to querying semistructured data with path constraints was proposed in 4] and later studied in 11, 12, 13] .  ... 
doi:10.1007/3-540-44543-9_13 fatcat:gag3ame54fetjbosvgznpk32qy

DVQ: A DTD-Driven Visual Query Interface for XML Database Systems [chapter]

Long Zhang, Shihui Zheng, Aoying Zhou, Hongjun Lu
2002 Visual and Multimedia Information Management  
With such interface, a user can easily form path-expression based queries by clicking elements in the DID tree displayed on the screen and supplying conditions if necessary.  ...  A number of query languages have been proposed for querying XML data. Most of those languages are path-expression based.  ...  But they cannot construct arbitrary regular path expressions and complex constraint conditions too.  ... 
doi:10.1007/978-0-387-35592-4_27 fatcat:hhz7z55hwray3f7ba5jntyrtu4

G-path

Yiyuan Bai, Chaokun Wang, Yuanchi Ning, Hanzhao Wu, Hao Wang
2013 Proceedings of the 22nd International Conference on World Wide Web - WWW '13 Companion  
With the flexibility of G-Path, the application is able to handle different kinds of queries.  ...  In this paper, we present a system of path query on large graphs, known as G-Path.  ...  A path pattern may involve constraints on nodes as well as edges, along with some repetitive patterns of its parts.  ... 
doi:10.1145/2487788.2487937 dblp:conf/www/BaiWNWW13 fatcat:unmiiegtpzfnndhiqrbmzzw6zq

A Modal Perspective on Path Constraints

N. Alechina
2003 Journal of Logic and Computation  
Several classes of path constraints for semistructured data are analysed and a number of decidability and complexity results proved for such constraints.  ...  The containment problem for the class of forward constraints cannot be expressed naturally by query containement between a conjunctive two-way regular path query with constants and a tree two-way regular  ...  Query containment between conjunctive two-way regular path queries with constants is roughly about the validity of questions of the form Ô ½ ¡ ¡ ¡ Ô Ò Õ ½ ¡ ¡ ¡ Õ Ñ . 2.  ... 
doi:10.1093/logcom/13.6.939 fatcat:hjkl4vpesne4npdubj7wcgu2ii
« Previous Showing results 1 — 15 out of 46,024 results