NDLI: Efficient Indices Using Graph Partitioning in RDF Triple Stores

Content Provider	IEEE Xplore Digital Library
Author	Ying Yan Chen Wang Aoying Zhou Weining Qian Li Ma Yue Pan
Copyright Year	2009
Abstract	With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extract structured data from Wikipedia articles, broke 100 million RDF triples in its latest release. Initiated by Tim Berners-Lee,likewise, the Linking Open Data (LOD) project has published and interlinked many open licence datasets which consisted of over 2 billion RDF triples so far. In this context, fast query response over such large scaled data would be one of the challenges to existing RDF data stores. In this paper, we propose a novel triple indexing scheme to help RDF query engine fast locate the instances within a small scope. By considering the RDF data as a graph, we would partition the graph into multiple subgraph pieces and store them individually, over which a signature tree would be built up to index the URIs. When a query arrives, the signature tree index is used to fast locate the partitions that might include the matches of the query by its constant URIs. Our experiments indicate that the indexing scheme dramatically reduces the query processing time in most cases because many partitions would be early filtered out and the expensive exact matching is only performed over a quite small scope against the original dataset.
Starting Page	1263
Ending Page	1266
File Size	265316
Page Count	4
File Format	PDF
ISBN	9781424434220
ISSN	10844627
DOI	10.1109/ICDE.2009.216
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-03-29
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Resource description framework Indexing Tree graphs Semantic Web Data mining Wikipedia Joining processes Licenses Engines Query processing
Content Type	Text
Resource Type	Article
Subject	Signal Processing Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Evaluation of Triple Indices in Retrieving Web Documents

Towards efficient sparql query processing on rdf data *.

Bitmat – scalable indexing and querying of large rdf graphs (technical report).

An Indexing Scheme for RDF and RDF Schema based on Suffix Arrays (2003)

An Approach to Semantic Information Retrieval

Towards Adaptive and Semantic Database Model for RDF Data Stores

An RDF-Based Framework for Semantic Indexing of Web Pages

Query Execution for RDF Data Using Structure Indexed Vertical Partitioning

Efficient SPARQL Query Evaluation in a Database Cluster

Efficient Indices Using Graph Partitioning in RDF Triple Stores

Similar Documents

Evaluation of Triple Indices in Retrieving Web Documents

Towards efficient sparql query processing on rdf data *.

Bitmat – scalable indexing and querying of large rdf graphs (technical report).

An Indexing Scheme for RDF and RDF Schema based on Suffix Arrays (2003)

An Approach to Semantic Information Retrieval

Towards Adaptive and Semantic Database Model for RDF Data Stores

An RDF-Based Framework for Semantic Indexing of Web Pages

Query Execution for RDF Data Using Structure Indexed Vertical Partitioning

Efficient SPARQL Query Evaluation in a Database Cluster

Efficient Indices Using Graph Partitioning in RDF Triple Stores