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
Approximate Querying for the Property Graph Language Cypher
2019
2019 IEEE International Conference on Big Data (Big Data)
Preserved Fulltext
This is the first time that query approximation has been investigated in the context of the property graph data model, which is becoming increasingly prevalent in research and industry. ...
This points to the need for approximate query processing capabilities that can automatically make changes to a query so as to aid in the incremental discovery of relevant information. ...
Early work on approximating graph queries focussed on approximation of regular path queries (RPQs) [10] and conjunctive regular path queries (CRPQs) [13] through edit operations (addition, deletion ...
doi:10.1109/bigdata47090.2019.9005466
dblp:conf/bigdataconf/FletcherPSW19
fatcat:t64w3tokf5ekhltv2hz6bjsm5u
Discovery of network properties with all-shortest-paths queries
2010
Theoretical 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.
Furthermore we show, for all the aforementioned properties, that "many" queries are needed in the worst case. ...
We study the problem as an online problem -an algorithm does not initially know the edge set of the network, and has to decide where to make the next query based on the information that was gathered by ...
), discover a property (or an approximation of a property) of the network (graph) with a minimum number of queries. ...
doi:10.1016/j.tcs.2010.01.010
fatcat:cu4okegmtzeejptodtmqwhavxq
Quantum Query Complexity of Minor-Closed Graph Properties
2012
SIAM journal on computing (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 2017; you can also visit the original URL.
The file type is application/pdf.
Example: Graph properties
f is a graph property if it doesn't depend on the vertex labels
bits
represent the edges of an n-vertex graph G
Classical:
for most graph properties (including all the ...
15 Applications to black-box graphs: FSP O(n 3/2 ) Ω(n) Θ(n 3/2 ) O(n α ), α < 3 • Detect graphs with edges using O(n) queries (so when deciding sparse graph properties, we can assume that the input ...
doi:10.1137/110833026
fatcat:xhtmk6eusfcp7ib54saooj5osa
Experiences with Implementing Landmark Embedding in Neo4j
2019
Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) - GRADES-NDA'19
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.
on the database. ...
Reachability, distance, and shortest path queries are fundamental operations in the field of graph data management with various applications in research and industry. ...
[1] extended landmark embedding to process approximate distance queries on edge labeled graphs. Distance and Shortest Path Queries. ...
doi:10.1145/3327964.3328496
dblp:conf/grades/HotzCWG19
fatcat:lkj5qqkbp5fpdf2b7tjnfgnrjy
Local Graph Partitions for Approximation and Testing
2009
2009 50th Annual IEEE Symposium on Foundations of 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 2017; you can also visit the original URL.
The file type is application/pdf.
hereditary property in any bounded degree hereditary families of graphs. ...
minor. • We show a simple proof that any minor-closed graph property is testable in constant time in the bounded degree model. • We prove that it is possible to approximate the distance to almost any ...
On the negative side, Trevisan [18] showed that for any δ > 0, a (2 − δ, εn)-approximation algorithm for vertex cover has to make Ω( √ n) queries to the graph. ...
doi:10.1109/focs.2009.77
dblp:conf/focs/HassidimKNO09
fatcat:reo7i3vue5djfglqkexjmdk42m
Approximate Evaluation of Label-Constrained Reachability Queries
[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 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we focus on the approximate evaluation of counting label-constrained reachability queries. We offer a human-explainable solution to graph Approximate Query Processing (AQP). ...
The current surge of interest in graph-based data models mirrors the usage of increasingly complex reachability queries, as witnessed by recent analytical studies on real-world graph query logs. ...
In this paper, we aim to offer human-explainable approximate graph query processing, by focusing on regular path queries that identify graph paths, through regular expressions on edge labels. ...
arXiv:1811.11561v1
fatcat:t355eg4akjgnhdv5d5jmgpy45a
Searching the Semantic Web: Approximate Query Processing Based on Ontologies
2006
IEEE Intelligent 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 2019; you can also visit the original URL.
The file type is application/pdf.
We present its theoretical foundation, its query language, and we stress its ability to process approximate queries. ...
Approximate query processing is then of prime importance for efficiently searching the Semantic Web. ...
g The Corese query language supports queries on ontologies just like on annotations since RDF Schemas are RDF graphs. ...
doi:10.1109/mis.2006.16
fatcat:oepc6x6srbcwpij7tedb4t3bq4
The Recommendation Click Graph: Properties and Applications
[chapter]
2012
Communications in Computer and Information 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 2017; you can also visit the original URL.
The file type is application/pdf.
Users' clicks on query recommendations contain a great deal of information about search intent, query ambiguity and search performance. ...
A directed edge in the graph connects the prior query and the clicked recommended query. By analyzing the graph, we develop methods for finding ambiguous queries and improving the search results. ...
Both the in-degree and out-degree distributions approximately follow a power law distribution. This property is very similar to a hyperlink graph. ...
doi:10.1007/978-3-642-34456-5_26
fatcat:bmsequy2uzh7zjpgfjmliruaea
Approximating expressive queries on graph-modeled data: The GeX approach
2015
Journal of Systems and Software
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.
We present the GeX (Graph-eXplorer) approach for the approximate matching of complex queries on graph-modeled data. ...
GeX generalizes existing approaches and provides for a highly expressive graph-based query language that supports queries ranging from keyword-based to structured ones. ...
In this paper we present the GeX (Graph-eXplorer) approach to support the approximate matching of complex queries on graph-modeled data. ...
doi:10.1016/j.jss.2015.07.028
fatcat:mkia2jxghfe25ogttncgygjalu
Contemplations on Testing Graph Properties
[chapter]
2011
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 2011; you can also visit the original URL.
The file type is application/pdf.
This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). ...
The second comment advocates paying more attention to the question of testing general graphs (rather than dense or bounded-degree ones). ...
Let us focus on the algorithmic contents of property testing of graphs. ...
doi:10.1007/978-3-642-22670-0_35
fatcat:67iwmp77mzgkddlrcpeudhrc4m
Introduction to Testing Graph Properties
[chapter]
2011
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 2011; you can also visit the original URL.
The file type is application/pdf.
This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). ...
The second comment advocates paying more attention to the question of testing general graphs (rather than dense or bounded-degree ones). ...
Let us focus on the algorithmic contents of property testing of graphs. ...
doi:10.1007/978-3-642-22670-0_32
fatcat:t2ctpk3z2vfzxivmcaerni4nwa
Introduction to Testing Graph Properties
[chapter]
2010
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 2011; you can also visit the original URL.
The file type is application/pdf.
This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). ...
The second comment advocates paying more attention to the question of testing general graphs (rather than dense or bounded-degree ones). ...
Let us focus on the algorithmic contents of property testing of graphs. ...
doi:10.1007/978-3-642-16367-8_7
fatcat:yfd3242so5b5bpjzmzkeznqqpu
Sublinear Time Algorithms
2011
SIAM Journal on Discrete Mathematics
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 discuss the types of answers that one can hope to achieve in this setting. ...
Acknowledgements We thank Ran Canetti, Krzysztof Onak, Madhu Sudan and Ning Xie for their extensive and helpful comments on this manuscript. ...
Parnas and Ron get a (c, ϵ · n)-approximation algorithm with query complexity independent of n, namely, d O(log(d/ϵ 3 )) , where d is a bound on the degree of the graph. ...
doi:10.1137/100791075
fatcat:zbjqeo6xdzb2jfm56vlnydv4gi
Property testing and its connection to learning and approximation
1998
Journal of the ACM
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 2014; you can also visit the original URL.
The file type is application/pdf.
A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the function on instances of its choice. ...
edge-queries into the graph, where ¤ is the distance parameter. ...
Testing Graph Properties We concentrate on testing graph properties using queries and with respect to the uniform distribution. ...
doi:10.1145/285055.285060
fatcat:uajf6einebddzczgcfux5kysse
Optimisation Techniques for Flexible SPARQL queries
2022
ACM Transactions on the Web
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 2022; you can also visit the original URL.
The file type is application/pdf.
These operators encapsulate different dimensions of query flexibility, namely approximation and generalisation, and they allow users to query complex, heterogeneous knowledge graphs without needing to ...
In the present paper, we focus on the design of two optimisation techniques targeted at speeding up the execution of SPARQL AR queries and on their empirical evaluation on three knowledge graphs: LUBM, ...
APPROX automatically applies approximations to a SPARQL 1.1 property path, such as inserting a property, removing a property, or substituting a property by a diferent one. ...
doi:10.1145/3532855
fatcat:bmpxueetprggrier5h5lkmxxla
« Previous
Showing results 1 — 15 out of 94,318 results