Efficient Linked-List RDF Indexing in Parliament
نویسندگان
چکیده
As the number and scale of Semantic Web applications in use increases, so does the need to efficiently store and retrieve RDF data. Current published schemes for RDF data management either fail to embrace the schema flexibility inherent in RDF or make restrictive assumptions about application usage models. This paper describes a storage and indexing scheme based on linked lists and memory-mapped files, and presents theoretical and empirical analysis of its strengths and weaknesses versus other techniques. This scheme is currently used in Parliament (formerly DAML DB), a triple store with rule support that has recently been released as open source.
منابع مشابه
Distributed Hierarchical Indexing of Publications
In this paper, we describe a model for indexing publications, which span across different loosely federated servers. This situation is found in many universities. The proposed model uses RDF (Resource Description Framework) as a language for describing the metadata for the resources across the digital library network. All the sites and publications in the network are treated as resources and th...
متن کاملApplying Random Indexing to Structured Data to Find Contextually Similar Words
Language resources extracted from structured data (e.g. Linked Open Data) have already been used in various scenarios to improve conventional Natural Language Processing techniques. The meanings of words and the relations between them are made more explicit in RDF graphs, in comparison to human-readable text, and hence have a great potential to improve legacy applications. In this paper, we des...
متن کاملLinked Data Indexing Methods: A Survey
Documents on the contemporary Web are based especially on HTML formats and, therefore, it is rather difficult to retrieve hidden structured information from them using automated agents. The concept of Linked Data based primarily on RDF data triples seems to successfully solve this drawback. However, we cannot directly adopt the existing solutions from relational databases or XML technologies, b...
متن کاملA Tool for Efficiently Processing SPARQL Queries on RDF Quads
We present a tool called RIQ (RDF Indexing on Quads) for efficiently processing SPARQL queries on large RDF datasets containing quads. RIQ’s novel design includes: (a) a vector representation of RDF graphs for efficient indexing, (b) a filtering index for efficiently organizing similar RDF graphs, and (c) a decrease-and-conquer strategy for efficient query processing using the filtering index t...
متن کاملLinked Data Querying through FCA-based Schema Indexing
The efficiency of SPARQL query evaluation against Linked Open Data may benefit from schema-based indexing. However, many data items come with incomplete schema information or lack schema descriptions entirely. In this position paper, we outline an approach to an indexing of linked data graphs based on schemata induced through Formal Concept Analysis. We show how to map queries onto RDF graphs b...
متن کامل