Ranked answer graph construction for keyword queries on RDF graphs without distance neighbourhood restriction

Authors:
Parthasarathy K.;Sreenivasa P. Kumar;Dominic Damien
Affiliations:
Indian Space Research Organisation, Bangalore, India;Indian Institute of Technology, Madras, Chennai, India;Indian Space Research Organisation, Bangalore, India
Venue:
Proceedings of the 20th international conference companion on World wide web
Year:
2011

Citing 13
Cited 0

XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Keyword Searching and Browsing in Databases using BANKS

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Personal information management with SEMEX

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Bidirectional expansion for keyword search on graph databases

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Finding and approximating top-k answers in keyword proximity search

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
BLINKS: ranked keyword searches on graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Semantic Web for the Working Ontologist: Effective Modeling in RDFS and OWL

Semantic Web for the Working Ontologist: Effective Modeling in RDFS and OWL
STAR: Steiner-Tree Approximation in Relationship Graphs

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Ontology-based interpretation of keywords for semantic search

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
SPARK: adapting keyword query to semantic search

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
The SWRC ontology – semantic web for research communities

EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
SemSearch: a search engine for the semantic web

EKAW'06 Proceedings of the 15th international conference on Managing Knowledge in a World of Networks

Quantified Score

Hi-index	0.00

Visualization

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.