Answering pattern match queries in large graph databases via graph embedding
نویسندگان
چکیده
منابع مشابه
Match Graph Construction for Large Image Databases
How best to efficiently establish correspondence among a large set of images or video frames is an interesting unanswered question. For large databases, the high computational cost of performing pair-wise image matching is a major problem. However, for many applications, images are inherently sparsely connected, and so current techniques try to correctly estimate small potentially matching subs...
متن کاملGraph summaries for optimizing graph pattern queries on RDF databases
The adoption of the Resource Description Framework (RDF) as a metadata and semantic data representation standard is spurring the development of high-level mechanisms for storing and querying RDF data. A common approach for managing and querying RDF data is to build on Relational/Object Relational Database systems and translate queries in an RDF query language into queries in the native language...
متن کاملSupplementary Material for “ Match Graph Construction for Large Image Databases ”
This appendix presents additional discussion on several aspects of the proposed algorithm. Sec. A presents a modification of our algorithm which enables users to reflect local connectivity in link prediction. The remaining sections focus on the label propagation application. Sec. B and C discuss functionalities of active label acquisition and adding new images to the match graph while Sec. D di...
متن کاملDistanceJoin: Pattern Match Query In a Large Graph Database
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest-path query, reachability verification, and pattern match. Among these, a pattern match query is more flexible compared to a subgraph search and more informative compared to a shortest-path or reachability query. In this paper, we address pattern match problems over a l...
متن کاملEnsuring Consistency in Graph Cache for Graph-Pattern Queries
Graph queries are costly, as they entail the NP-Complete subgraph isomorphism problem. Graph caching had been recently suggested, showing the potential to significantly accelerate subgraph/supergraph queries. Subsequently, GraphCache, the first full-fledged graph caching system was put forth. However, when the underlying dataset changes concurrently with the query workload proceeding, how to en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2011
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-011-0238-6