Proceedings ArticleDOI
Ranked answer graph construction for keyword queries on RDF graphs without distance neighbourhood restriction
K. Parthasarathy,Sreenivasa P. Kumar,Dominic Damien +2 more
- pp 361-366
TLDR
This paper presents an elegant algorithm for keyword query processing on RDF data that does not assume a fixed distance bound and adopts a pruned exploration mechanism where closely related nodes are identified, subgraphs are pruned and joined using suitable hook nodes.Abstract:
RDF and RDFS have recently become very popular as frameworks for representing data and meta-data in form of a domain description, respectively. RDF data can also be thought of as graph data. In this paper, we focus on keyword-based querying of RDF data. In the existing approaches for answering such keyword queries, keywords are mapped to nodes in the graph and their neighborhoods are explored to extract subgraph(s) of the data graph that contain(s) information relevant to the query. In order to restrict the computational effort, a fixed distance bound is used to define the neighborhoods of nodes. In this paper we present an elegant algorithm for keyword query processing on RDF data that does not assume such a fixed bound. The approach adopts a pruned exploration mechanism where closely related nodes are identified, subgraphs are pruned and joined using suitable hook nodes. The system dynamically manages the distance depending on the closeness between the keywords. The working of the algorithm is illustrated using a fragment of AIFB institute data represented as an RDF graph.read more
Citations
More filters
Journal ArticleDOI
Summarizing answer graphs induced by keyword queries
TL;DR: This paper studies the summarization problem for the answer graphs induced by a keyword query Q, and proposes exact and heuristic summarization algorithms that aim to find minimized summary graphs with certain coverage ratio.
Journal ArticleDOI
Efficient computation of distance labeling for decremental updates in large dynamic graphs
TL;DR: This paper proposes maintenance algorithms based on distance labeling, which can handle decremental updates efficiently and can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL).
Proceedings ArticleDOI
SIEF: Efficiently Answering Distance Queries for Failure Prone Graphs
TL;DR: SIEF, a Supplemental Index for Edge Failures on a graph, which is based on distance labeling is proposed, which can support distance queries with edge failures efficiently and is able to compute very compact distance labeling for all singe-edge failure cases on dynamic graphs.
Proceedings Article
Usability and Expressiveness in Database Keyword Search: Bridging the Gap
Elena Demidova,Wolfgang Nejdl +1 more
TL;DR: Challenges in database keyword search which have not been sufficiently addressed are presented including aspects of query expressiveness, relevance and incremental refinement, which will facilitate effective disambiguation of a broader range of queries and thus increase usability of database systems for end users.
Journal ArticleDOI
Ranking methods for entity-oriented semantic web search
TL;DR: A technical review of semantic search methods used to support text‐based search over formal Semantic Web knowledge bases and reflective examples from the literature are presented, which should appeal to readers interested in a deeper perspective on the various methods and systems implemented in the outlined literature.
References
More filters
Proceedings ArticleDOI
Keyword searching and browsing in databases using BANKS
TL;DR: BANKS is described, a system which enables keyword-based search on relational databases, together with data and schema browsing, and presents an efficient heuristic algorithm for finding and ranking query results.
Proceedings ArticleDOI
XRANK: ranked keyword search over XML documents
TL;DR: The XRANK system is presented, designed to handle the novel features of XML keyword search, which naturally generalizes a hyperlink based HTML search engine such as Google and can be used to query a mix of HTML and XML documents.
Proceedings ArticleDOI
BLINKS: ranked keyword searches on graphs
TL;DR: BLINKS follows a search strategy with provable performance bounds, while additionally exploiting a bi-level index for pruning and accelerating the search, and offers orders-of-magnitude performance improvement over existing approaches.
Proceedings Article
Bidirectional expansion for keyword search on graph databases
Varun Kacholia,Shashank Pandit,Soumen Chakrabarti,Sundararajarao Sudarshan,Rushi Desai,Hrishikesh Karambelkar +5 more
TL;DR: This paper proposes a new search algorithm, Bidirectional Search, which improves on Backward Expanding search by allowing forward search from potential roots towards leaves, and devise a novel search frontier prioritization technique based on spreading activation.
Proceedings ArticleDOI
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data
TL;DR: An extended inverted index is proposed to facilitate keyword-based search, and a novel ranking mechanism for enhancing search effectiveness is presented, which achieves both high search efficiency and high accuracy.