Adding regular expressions to graph reachability and pattern queries
نویسندگان
چکیده
منابع مشابه
Graph Reachability Queries: A Survey
There are numerous applications that need to deal with a large graph, including bioinformatics, social science, link analysis, citation analysis, and collaborative networks. A fundamental query is to query whether a node is reachable from another node in a large graph, which is called a reachability query. In this survey, we discuss several existing approaches to process reachability queries. I...
متن کاملRecursive Graph Deduction and Reachability Queries
In this paper, we discuss an adjustable strategy for the transitive closure compression to support graph reachability queries, asking whether a given node u in a directed graph G is reachable from another node v through a path. The main idea behind it is to define a series of graph deductions G0(V0, E0) (= G), G1(V1, E1), ..., Gk(Vk, Ek) with ni > ni+1 (i = 0, ..., k 1), where ni = |Vi|. Each n...
متن کاملRepairing Regular Expressions by Adding Missing Words
Regular expressions are used in many information extraction systems like YAGO, DBpedia, Gate and SystemT. However, they sometimes do not match what their creator wanted to find. We investigate how missing words can be added automatically to a regular expression by creating disjunctions at the appropriate positions. Our demo visualizes the steps that our algorithm employs to repair the regular e...
متن کاملAdding Logical Operators to Tree Pattern Queries on Graph-Structured Data
As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important type of queries in real-world applications. Most practical query languages, such as XQuery and SPARQL, support logical expressions using logical-AND/OR/NOT operators to define structural constraints of tree patterns. In this paper, (1) we propose ...
متن کاملOptimizing Regular Path Expressions Using Graph Schemas
Several languages, such as LOREL and UnQL, support querying of semi-structured data. Others, such as WebSQL and WebLog, query Web sites. All these languages model data as labeled graphs and use regular path expressions to express queries that traverse arbitrary paths in graphs. Naive execution of path expressions is ineecient, however, because it often requires exhaustive graph search. We descr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Computer Science
سال: 2012
ISSN: 2095-2228
DOI: 10.1007/s11704-012-1312-y