146,427 Hits in 3.1 sec

Querying Encrypted Graph Databases

Nahla Aburawi, Alexei Lisitsa, Frans Coenen
2018 Proceedings of the 4th International Conference on Information Systems Security and Privacy  
We report the efficiency of query execution for various types of queries on encrypted and non-encrypted Neo4j graph databases.  ...  We present an approach to execution of queries on encrypted graph databases. The approach is inspired by CryptDB system for relational DBs (R. A. Popa et al).  ...  Neo4j database management system comes with the graph query language Cypher.  ... 
doi:10.5220/0006660004470451 dblp:conf/icissp/AburawiLC18 fatcat:dggliuqt6rhv7hyjexikhxedqe

Querying Large Graph Databases [chapter]

Yiping Ke, James Cheng, Jeffrey Xu Yu
2010 Lecture Notes in Computer Science  
(a): Graph database Fig. (b): Two subgraphs Fig.  ...   Counterpart of subgraph query processing  Problem Given a graph database D and a graph query q Find all graphs g in D s.t. q is a supergraph of g 2010-4-3 70 DASFAA 10 Tutorial Many Applications  ... 
doi:10.1007/978-3-642-12098-5_57 fatcat:x4a5sd6aijfzxjyzp7lqgjw75y

Functional querying in graph databases

Jaroslav Pokorný
2017 Vietnam Journal of Computer Science  
The paper is focused on a functional querying in graph databases. We consider labelled property graph model and mention also the graph model behind XML databases.  ...  As a formal approach to declarative graph database querying a version of typed lambda calculus is used.  ...  One rather popular definition of a graph database (GDB), also called a graph-oriented database, says that it is a database that uses graph theory to store, map and query relationships.  ... 
doi:10.1007/s40595-017-0104-6 fatcat:4xusr7crzvcvbl2rdgnd6frfmu

Query languages for graph databases

Peter T. Wood
2012 SIGMOD record  
Query languages for graph databases started to be investigated some 25 years ago.  ...  With much current data, such as linked data on the Web and social network data, being graph-structured, there has been a recent resurgence in interest in graph query languages.  ...  Acknowledgements I would like to dedicate this survey to the memory of Alberto Mendelzon, whose insight and vision inspired me to investigate graph query languages some 25 years ago.  ... 
doi:10.1145/2206869.2206879 fatcat:ewen3opekbfyzbv3pnc6h6o7tm

Querying graph databases with XPath

Leonid Libkin, Wim Martens, Domagoj Vrgoč
2013 Proceedings of the 16th International Conference on Database Theory - ICDT '13  
Another common database model -graph databases -also requires a heavy use of navigation in queries; yet it largely adopts a different approach to querying, relying on reachability patterns expressed with  ...  Our goal here is to investigate the behavior and applicability of XPath-like languages for querying graph databases, concentrating on their expressiveness and complexity of query evaluation.  ...  Navigation languages for graph databases. Most navigational formalisms for querying graph databases are based on regular path queries, or RPQs [19] , and their extensions.  ... 
doi:10.1145/2448496.2448513 dblp:conf/icdt/LibkinMV13 fatcat:i34u6ty3afh3na3yay6s3ab76a

Functional Querying in Graph Databases [chapter]

Jaroslav Pokorný
2017 Lecture Notes in Computer Science  
The paper is focused on a functional querying in graph databases. We consider labelled property graph model and mention also the graph model behind XML databases.  ...  As a formal approach to declarative graph database querying a version of typed lambda calculus is used.  ...  One rather popular definition of a graph database (GDB), also called a graph-oriented database, says that it is a database that uses graph theory to store, map and query relationships.  ... 
doi:10.1007/978-3-319-54472-4_28 fatcat:rx5s23v6dzca3grshhegtkx55i

Regular Queries on Graph Databases

Juan L. Reutter, Miguel Romero, Moshe Y. Vardi
2016 Theory of Computing Systems  
We want to use CQs for querying graph databases over a finite alphabet .  ...  C2RPQs The basic mechanism for querying graph databases is the class of twoway regular path queries, or 2RPQs [18] . A 2RPQ E over is a regular expression over ± .  ...  Acknowledgments We'd like to thank Pablo Barceló for helpful discussions on regular queries. The third author is grateful to Vincent Jugé for early discussions on containment of regular queries.  ... 
doi:10.1007/s00224-016-9676-2 fatcat:sa46xtmz2jgrblphnnqdaoc2fe

Microblogging Queries on Graph Databases

Oshini Goonetilleke, Saket Sathe, Timos Sellis, Xiuzhen Zhang
2015 Proceedings of the GRADES'15 on - GRADES'15  
In this paper, we share our experience on executing a wide variety of micro-blogging queries on two popular graph databases: Neo4j and Sparksee.  ...  This poses new challenges to the data management systems, such as graph databases, that are typically suitable for analyzing such data.  ...  Since graph database systems support management of such types of graphs, a natural way to analyze Twitter data is by using a graph database.  ... 
doi:10.1145/2764947.2764952 dblp:conf/sigmod/GoonetillekeSSZ14 fatcat:6gstnfxw2vc7tper5amb3aflpm

Querying Graph Databases: What Do Graph Patterns Mean? [chapter]

Stephan Mennicke, Jan-Christoph Kalo, Wolf-Tilo Balke
2017 Lecture Notes in Computer Science  
Querying graph databases often amounts to some form of graph pattern matching.  ...  Finding (sub-)graphs isomorphic to a given graph pattern is common to many graph query languages, even though graph isomorphism often is too strict, since it requires a one-to-one correspondence between  ...  Thereby, the nodes of a graph database are often referred to as graph database objects. Graph database query languages let the user query these graph structures in an SQL-like fashion.  ... 
doi:10.1007/978-3-319-69904-2_11 fatcat:ytxxszobsrfjjpouvnydx2bhru

Analyzing graph databases by aggregate queries

Anton Dries, Siegfried Nijssen
2010 Proceedings of the Eighth Workshop on Mining and Learning with Graphs - MLG '10  
Surprisingly, however, tools for querying graph and network databases are much less well developed than for relational data, and only recently an increasing number of studies are devoted to graph or network  ...  A notable feature of our language is that it also supports probabilistic graph queries by conceiving of such queries as aggregating queries. We demonstrate its value on a simple data analysis task.  ...  Graph Query Languages. A number of query languages for graph databases have been proposed, many of which have been described in a recent survey [2] .  ... 
doi:10.1145/1830252.1830258 dblp:conf/mlg/DriesN10 fatcat:uqlxqrplfzgo7nld5sqjin6yc4

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.  ...  The resulting formalism is computationally attractive -- queries can be answered in non-deterministic logarithmic space in the size of the database.  ...  Conclusions We defined a new query language for graph databases, OPRA and demonstrated its expressive power in two ways.  ... 
arXiv:1710.04419v1 fatcat:6yuadecg7bhapnv7eihph2vqfu

Why-query support in graph databases

Elena Vasilyeva
2016 2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)  
Our objective is to extend graph databases with debugging functionality in the form of why-queries for unexpected query results on the example of pattern matching queries, which are one of general graph-query  ...  Forced to debug queries manually and overwhelmed by the amount of query constraints, users can get frustrated by using graph databases.  ...  in graph databases.  ... 
doi:10.1109/icdew.2016.7495652 dblp:conf/icde/Vasilyeva16 fatcat:snct4vcbsrf4rpdjjbqtxyzpq4

Efficient query processing on graph databases

James Cheng, Yiping Ke, Wilfred Ng
2009 ACM Transactions on Database Systems  
We study the problem of processing subgraph queries on a database that consists of a set of graphs.  ...  The answer to a subgraph query is the set of graphs in the database that are supergraphs of the query. In this article, we propose an efficient index, FG*-index, to solve this problem.  ...  Processing a subgraph query is a fundamental operation for querying graph databases.  ... 
doi:10.1145/1508857.1508859 fatcat:h5ss7tvaq5cdbjrb365nqzabvq

Query Optimization Techniques in Graph Databases

Ali Ben Ammar
2016 International Journal of Database Management Systems  
In this paper, we survey the query optimization techniques in graph databases. In particular,we focus on the features they have introduced to improve querying graph-like data.  ...  Today, they represent a requirementfor many applications that manage graph-like data,like social networks.Most of the techniques, applied to optimize queries in graph databases, have been used in traditional  ...  Moreover, there is no standard language to query graph database.  ... 
doi:10.5121/ijdms.2016.8401 fatcat:vvxypct2ojhzhajir3kbrwr5gq

Querying relational databases using conceptual graph

Nguyễn Kim Anh
2012 Journal of Computer Science and Cybernetics  
This paper presents a formalism, called conceptual graphs, that can represent relational database schemas and queries according to the user's view and access data according to the system's view.  ... 
doi:10.15625/1813-9663/22/3/1107 fatcat:bnv55ubfurdq7e2stxdy74cusq
« Previous Showing results 1 — 15 out of 146,427 results