A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Q-Graph: Preserving Query Locality in Multi-Query Graph Processing
[article]
2018
arXiv
pre-print
Preserved Fulltext
, i.e., processing multiple graph queries in parallel on a shared graph. ...
Arising user-centric graph applications such as route planning and personalized social network analysis have initiated a shift of paradigms in modern graph processing systems towards multi-query analysis ...
Worker API Workers • Graph processing • Low-level vertex-centric • Local
Q-GRAPH SYSTEM In this section, we provide an overview of our distributed graph system Q-Graph for parallel graph query processing ...
arXiv:1805.11900v1
fatcat:u3u64bbiuja2dgmbcmptvonmru
Efficient query processing on graph databases
2009
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the problem of processing subgraph queries on a database that consists of a set of graphs. ...
Index probing is to find the query in the index, or to find the graphs from which we can generate a candidate answer set for the query. ...
In most of the existing work, a similarity query is processed by evaluating the set of relaxed graphs of the query graph using the index for processing subgraph queries. ...
doi:10.1145/1508857.1508859
fatcat:h5ss7tvaq5cdbjrb365nqzabvq
Recursive query processing using graph traversal techniques
1996
Proceedings of the fifth international conference on Information and knowledge management - CIKM '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Because STARBASE takes a skmgly graph-oriented view of both the database and the deduction tules, the evaluation of a query on a database can be viewed as a process of traversing paths in the graph representing ...
The evahmtion of a query on a &t@base in STARBASE can be viewed as a process of traversing paths in the database graph, where a path is a succession of hyperlinks. ...
The main application of the proposed method is in recursive query processing on deductive databases. ...
doi:10.1145/238355.238371
dblp:conf/cikm/Pulido96
fatcat:wzp5xvqee5bdvh5cwa262rv7zy
Processing SPARQL queries over distributed RDF graphs
2016
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a "partial evaluation and assembly" framework. ...
Answering a SPARQL query Q is equivalent to finding subgraph matches of the query graph Q over RDF graph G. ...
Within the context of graph processing, the technique has been used to evaluate reachability queries [13] , and graph simulation [31, 14] over graphs. ...
doi:10.1007/s00778-015-0415-0
fatcat:femvkoqo3vcqnfkon5tbgxcdxe
Processing SPARQL Queries Over Distributed RDF Graphs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a "partial evaluation and assembly" framework. ...
Answering a SPARQL query Q is equivalent to finding subgraph matches of the query graph Q over RDF graph G. ...
Within the context of graph processing, the technique has been used to evaluate reachability queries [13] , and graph simulation [31, 14] over graphs. ...
arXiv:1411.6763v4
fatcat:upbntluktba45fmfdlkzcnzjru
Processing scientific mesh queries in graph databases
2014
Proceedings of the 23rd International Conference on World Wide Web - WWW '14 Companion
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We conduct experiments to measure the performance of the graph database solution in processing mesh queries and compare it with GrAL mesh library and PostgreSQL database on synthetic and real mesh datasets ...
Based on the experiments, we propose a mediator architecture for processing mesh queries by using the three database systems. ...
The goal is to evaluate performance of mesh libraries, graph databases, and relational databases for processing mesh queries. ...
doi:10.1145/2567948.2580061
dblp:conf/www/MahdirajiB14
fatcat:2xeagw2jmnhi5cl35hcf66dr7a
Distributed graph query processing in dynamic networks
2012
2012 IEEE International Conference on Pervasive Computing and Communications Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider two popular classes of graph queries (random walk queries and shortest path queries), present both BSP and BAP algorithms for these queries and evaluate their performance using realistic graphs ...
In this paper we examine a popular network computational model (BSP: Bulk Synchronous Parallel) that has been adopted by the Google Pregel system to support large scale graph processing. ...
DISTRIBUTED GRAPH QUERIES In this section we will investigate distributed graph query processing in the BAP model. ...
doi:10.1109/percomw.2012.6197481
dblp:conf/percom/SrivatsaKY12
fatcat:zdltb6dojzflhia4s2hbh66xpq
Twig query processing over graph-structured XML data
2004
Proceedings of the 7th International Workshop on the Web and Databases colocated with ACM SIGMOD/PODS 2004 - WebDB '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. ...
In this paper, we investigate query evaluation techniques applicable to graph-structured data. ...
PROCESSING TWIGS IN GRAPHS In this section, we describe our solution to efficiently process twig queries over graph structured data. ...
doi:10.1145/1017074.1017087
dblp:conf/webdb/VagenaMT04
fatcat:eylnbclcyzfctfjqbhosqiko3i
Efficient Continuous Multi-Query Processing over Graph Streams
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we therefore introduce the notion of continuous multi-query processing over graph streams and discuss its application to a number of use cases. ...
Capturing the continuous evolution of a graph can be achieved by long-standing sub-graph queries. ...
However, these techniques are designed for static graphs and are not suitable for processing continuous graph queries on evolving graphs. ...
arXiv:1902.05134v1
fatcat:l5py5fqwfnappefaof7xw6njim
Efficient processing of distance queries in large graphs
2012
Proceedings of the 2012 international conference on Management of Data - SIGMOD '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper summarizes the contents of the paper Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach [1] by James Cheng, Shumo Chu, Carter Cheng -all affiliated with the Nanzang ...
The paper presents an I/O-efficient algorithm for processing single-source shortest path or distance queries over a large graph, with the aid of a disk-resident tree of vertex covers, called VC-index. ...
Figure 6 shows the distance graph D, 4 constructed from the graph G in Figure 2
Query Processing To process distance queries of the type dist G (s, v) from any vertex s V G to ∀v V G with VC-index ...
doi:10.1145/2213836.2213888
dblp:conf/sigmod/ChengKCC12
fatcat:zkr625iopzeelk6s3ui2mrec5q
Parallel Query Processing and Edge Ranking of Graphs
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we deal with the problem of finding an optimal query execution plan in database systems. ...
We improve the analysis of a polynomial-time approximation algorithm due to Makino et al. for designing query execution plans with almost optimal number of parallel steps. ...
Note that the height of T (the length of the longest path from the root to a leaf) is the number of parallel steps required to process the query. So, it is desirable to find a tree T of small height. ...
doi:10.1007/11752578_56
fatcat:4qe2ges45vhsnogbggp37nnhg4
Efficient algorithms for supergraph query processing on graph databases
2009
Journal of combinatorial optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. ...
to queries during query processing. ...
stored graphs to queries during query processing. ...
doi:10.1007/s10878-009-9221-1
fatcat:dpvn3mclxnem3hja7hzfkqh2ne
Fast Dual Simulation Processing of Graph Database Queries (Supplement)
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this supplement paper we present in detail all proofs, discussions of experimental results, and complexity analysis for the original paper "Fast Dual Simulation Processing of Graph Database Queries" ...
In this paper we bridge this gap by introducing a new dual simulation process operating on SPARQL queries. ...
Conclusion We proposed efficient processing of SPARQL queries based on graph pattern matching. ...
arXiv:1810.09355v1
fatcat:ueomzz2si5fybo2fyk3ai26seq
Index design and query processing for graph conductance search
2010
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Eighth Work-
shop on Mining and Learning with Graphs (MLG 2010), Jul 24-25, 2010. Wash-
ington D.C.
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han. ...
The 10th
International Conference on Information Processing in Sensor Networks (IPSN
2011), Apr 12-14, 2011. Chicago, IL.
Parikshit Sondhi, Manish Gupta, ChengXiang Zhai, Julia Hockenmaier. ...
doi:10.1007/s00778-010-0204-8
fatcat:ng6lvepzmvefhcbpjewx2r6h2e
Towards Efficient Query Processing on Massive Time-Evolving Graphs
2012
Proceedings of the 8th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The second is the answering of reachability queries on any snapshot of a TEG and the third is that of processing pattern matching queries in TEGs. ...
The ability to scalably process various types of queries on massive TEGs is central to building powerful analytic applications for these domains. ...
Both reachability queries and subgraph queries have wide applications in diverse areas such as XML query processing and bio-informatics. ...
doi:10.4108/icst.collaboratecom.2012.250532
dblp:conf/colcom/FardARM12
fatcat:74gujymfdrckzodi4tfdurogbe
« Previous
Showing results 1 — 15 out of 234,746 results