Filters








2,480 Hits in 7.2 sec

Personalized Best Answer Computation in Graph Databases [chapter]

Michael Ovelgönne, Noseong Park, V. S. Subrahmanian, Elizabeth K. Bowman, Kirk A. Ogaard
2013 Lecture Notes in Computer Science  
In this paper, we present scalable algorithms to find the top-K answers to a practically important subset of SPARQLqueries, denoted as importance queries, via a suite of pruning techniques.  ...  Though subgraph matching has been extensively studied as a query paradigm in semantic web and social network data environments, a user can get a large number of answers in response to a query.  ...  We defined the notion of importance queries as users are usually only interested in the most important query answers. Consequently, we will discuss top-k query answer algorithms.  ... 
doi:10.1007/978-3-642-41335-3_30 fatcat:e2pvuwrzwjdzdgvlzi2opaa3du

Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data

Thanh Tran, Haofen Wang, Sebastian Rudolph, Philipp Cimiano
2009 Proceedings / International Conference on Data Engineering  
For the computation of queries, we propose a novel algorithm for the exploration of top-k matching subgraphs.  ...  Instead of computing answers directly as in previous approaches, we first compute queries from the keywords, allowing the user to choose the appropriate query, and finally, process the query using the  ...  Since we are interested in the top-k queries, graph elements are also augmented with scores.  ... 
doi:10.1109/icde.2009.119 dblp:conf/icde/TranWRC09 fatcat:oju6arir5zdano2zrecmmlcwg4

Considering User Intention in Differential Graph Queries

Elena Vasilyeva, Maik Thiele, Christof Bornhövd, Wolfgang Lehner
2015 Journal of Database Management  
To support users in such situations, differential queries can be used that deliver missing parts of a graph query.  ...  Empty answers are a major problem by processing pattern matching queries in graph databases. Especially, there can be multiple reasons why a query failed.  ...  Top-K Differential Queries We define a top-k differential query as a directed graph ( ) , , , , , k q G V E u f g k = over attribute space .  ... 
doi:10.4018/jdm.2015070102 fatcat:p4hbrt4lsvbhva63tlynl7m7fi

Hermes: Data Web search on a pay-as-you-go integration infrastructure

Thanh Tran, Haofen Wang, Peter Haase
2009 Journal of Web Semantics  
To provide an end-user oriented interface, we support expressive user information needs by translating keywords into structured queries.  ...  These structured queries are decomposed into queries against the local Web data sources, which are then processed in a distributed way.  ...  vertex v k c ∈ V C or a relation edge label e l r ∈ L R .  ... 
doi:10.1016/j.websem.2009.07.001 fatcat:plnu6otwwvcrxm24ccqfdvhoou

Hermes: Data Web Search on a Pay-as-You-Go Integration Infrastructure

Thanh Tran, Haofen Wang, Peter Haase
2009 Social Science Research Network  
To provide an end-user oriented interface, we support expressive user information needs by translating keywords into structured queries.  ...  These structured queries are decomposed into queries against the local Web data sources, which are then processed in a distributed way.  ...  vertex v k c ∈ V C or a relation edge label e l r ∈ L R .  ... 
doi:10.2139/ssrn.3199428 fatcat:zedxi7lv5jez3hs5kcnwpani2u

Subgraph Similarity Search in Large Graphs [article]

Kanigalpula Samanvi, Naveen Sivadasan
2015 arXiv   pre-print
These graphs are typically noisy and contain thousands of vertices and millions of edges. In many cases, the graphs are unlabeled and the notion of similarity is also not well defined.  ...  We assume that the query graph and target graph are undirected and unlabeled. We use graphlet kernels shervashidze2009efficient to define graph similarity.  ...  In [25] , algorithm for computing top-k approximate subgraph matches for a given query graph in a large labeled target graph is given.  ... 
arXiv:1512.05256v1 fatcat:zbxyuzqmhbfn7f52gdh44jfdlm

An Efficient System for Subgraph Discovery [article]

Aparna Joshi, Yu Zhang, Petko Bogdanov, Jeong-Hyon Hwang
2018 arXiv   pre-print
Subgraph discovery in a single data graph---finding subsets of vertices and edges satisfying a user-specified criteria---is an essential and general graph analytics operation with a wide spectrum of applications  ...  Given such specifications, Nuri efficiently finds the k most relevant subgraphs using only a single computer.  ...  Top-k Query Processing. In the context of database systems, various techniques for top-k queries have been developed [30] .  ... 
arXiv:1807.08888v1 fatcat:msk75roddjbxjoonpzouioqrr4

IncMap: pay as you go matching of relational schemata to OWL ontologies

Christoph Pinkel, Carsten Binnig, Evgeny Kharlamov, Peter Haase
2013 International Semantic Web Conference  
IncMap is designed to work in a query-driven, pay as you go fashion and leverages partial, user-verified mappings to improve subsequent mapping suggestions.  ...  This effectively reduces the overall effort compared to compiling a mappings in one step. Moreover, IncMap can incorporate knowledge from user queries to enhance suggestion quality.  ...  In the first step, directed labeled graphs G(S) and G(S ) are constructed from S and S , where the nodes represent the schema elements, and the edges with labels define relationships between the schema  ... 
dblp:conf/semweb/PinkelBKH13a fatcat:ikxoghlt5zh25cfxklyeoblzg4

STUN: querying spatio-temporal uncertain (social) networks

Chanhyun Kang, Andrea Pugliese, John Grant, V. S. Subrahmanian
2014 Social Network Analysis and Mining  
We develop a hierarchical index structure to answer SM queries to STUN databases and show that the index supports answering very complex queries over 1M+ edge networks in under a second.  ...  We also introduce the class of STUNRank queries in which we characterize the importance of vertices in STUN databases, taking space, time, and uncertainty into account.  ...  In more detail, for (1) users may define 3 query-unaware rank flow functions: For (2) users may define a function score : V ∪ L → N that expresses the relative importance of vertices and labels.  ... 
doi:10.1007/s13278-014-0156-x fatcat:7h3tfwjfjjebrn5xxk4vwk56gm

Approximate entity extraction in temporal databases

Wei Lu, Gabriel Pui Cheong Fung, Xiaoyong Du, Xiaofang Zhou, Lijiang Chen, Ke Deng
2011 World wide web (Bussum)  
We study the problem of efficiently extracting K entities, in a temporal database, which are most similar to a given search query.  ...  This problem is well studied in relational databases, where each entity is represented as a single record and there exist a variety of methods to define the similarity between a record and the search query  ...  Definition of graph score We define the graph score of a candidate graph based on weights of its vertexes and edges, where weights of a vertex and an edge are defined as follows: Definition 6 (Weight of  ... 
doi:10.1007/s11280-011-0109-5 fatcat:4lhee52wnfc7tgc6wugfjriuhq

Top-k subgraph matching query in a large graph

Lei Zou, Lei Chen, Yansheng Lu
2007 Proceedings of the ACM first Ph.D. workshop in CIKM on - PIKM '07  
In this paper, we address top-k sub-graph matching query problem, which is defined as follows: given a query graph Q, we locate top-k matchings of Q in a large data graph G according to a score function  ...  The score function is defined as the sum of the pairwise similarity between a vertex in Q and its matching vertex in G.  ...  For the clear presentation, we use sum function as Score(X) in this paper. Our top-k subgraph matching query is defined as follows: DEFINITION 1.6.  ... 
doi:10.1145/1316874.1316897 dblp:conf/cikm/ZouCL07 fatcat:rkfirmuedjhondh6cfzcalv4uu

Graph Database Indexing Using Structured Graph Decomposition

David W. Williams, Jun Huan, Wei Wang
2007 2007 IEEE 23rd International Conference on Data Engineering  
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures.  ...  The primary structure is a directed acyclic graph which contains a node for each of the unique, induced subgraphs of the database graphs.  ...  A K-NN query reports the K graphs in a graph database that are most similar to the query, while a range query determines all graphs in the database whose similarity score is within a user-specified tolerance  ... 
doi:10.1109/icde.2007.368956 dblp:conf/icde/WilliamsHW07 fatcat:ixv4o5cwo5fdppusht5buuszjq

Description-Driven Community Detection

Simon Pool, Francesco Bonchi, Matthijs van Leeuwen
2014 ACM Transactions on Intelligent Systems and Technology  
In the case of community detection this means finding good communities (a set of nodes cohesive in the social graph) which are associated with good descriptions in terms of user information (node attributes  ...  Towards this goal, in this article we define and study the problem of finding a diverse set of cohesive communities with concise descriptions.  ...  Given an attributed graph G = (V, E, A) and an integer k, find the top-k community-query pairs (C, Q), where C ⊆ V , Q ∈ Q A , and top-k is defined with respect to the overall score function σ: σ(C, Q)  ... 
doi:10.1145/2517088 fatcat:3qtfraupk5cnvmw5n4ohwddxme

Ranking the answer trees of graph search by both structure and content

Ming Zhong, Mengchi Liu
2012 Proceedings of the 1st Joint International Workshop on Entity-Oriented and Semantic Search - JIWES '12  
Meanwhile, it will not reduce the efficiency of top-k search algorithms by performing an edge re-weighting process offline.  ...  Keyword search on graphs aims to find minimum connected trees containing the keywords. Normally, the answer trees are ranked by their topological structures.  ...  Let us consider how to efficiently process a keyword query in top-k manner under the scoring function.  ... 
doi:10.1145/2379307.2379314 fatcat:keflzs3tujfulo26obbo6ewqji

Continuous Queries for Multi-Relational Graphs [article]

Sutanay Choudhury, Lawrence B. Holder, Abhik Ray, George Chin Jr., John T. Feo
2013 arXiv   pre-print
Continuous queries or techniques to search for rare events that typically arise in monitoring applications have been studied extensively for relational databases.  ...  This work is dedicated to answer the question that emerges naturally: how can we efficiently execute a continuous query on a dynamic graph?  ...  For the location vertex we specify the labels shown in the top diagram in Fig. 7 and observe the performance.  ... 
arXiv:1209.2178v2 fatcat:wusxy3r6srgubkadzkk57ii4la
« Previous Showing results 1 — 15 out of 2,480 results