Optimized index structures for querying RDF from the Web

By Andreas Harth, Stefan Decker. Third Latin American Web Congress (LA-WEB'2005), 2005

320 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/3b191386bf16b18dcf0c532b5fb40ac961a73ed7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Michael Schmidt
2. Nadine Cullot
3. Christophe Nicolle
4. C. Emani
5. Abraham Bernstein
6. Panagiotis Karras
7. Cathrin Weiss
8. Aidan Hogan

In Computer Networks and Communications

1. Michael Schmidt
2. Cathrin Weiss
3. Abraham Bernstein
4. Panagiotis Karras
5. Nadine Cullot
6. Christophe Nicolle
7. C. Emani
8. Aidan Hogan

In Signal Processing

1. Michael Schmidt
2. Abraham Bernstein
3. Nadine Cullot
4. Christophe Nicolle
5. Panagiotis Karras
6. C. Emani
7. Cathrin Weiss
8. Aidan Hogan

Citations in the corpus

• The Internet of Things: A Survey from the Data-Centric Perspective (2013, unknown): “The work in [51] creates six indexes which cover all these 16 access patterns.”
• Foundations of SPARQL query optimization (2008, background): “In addition, indices [13] and storage schemes [30, 34, 6, 3] for RDF have been explored, to provide efficient data access paths.”
• Querying Distributed RDF Data Sources with SPARQL (2008, unknown): “[11, 12].”
• Hexastore: sextuple indexing for semantic web data management (2008, methodology): “This scheme allows for the quick retrieval of quads conforming to an access pattern where any of s, p, o, c is either specified or a variable [27].”
• Understandable Big Data: A survey (2015, methodology): “Likewise, but on RDF databases, [50] use B + − Trees to index object identifiers of RDF nodes and also use an inverted index to improve keyword queries.”
• YARS2: A Federated Repository for Querying Graph Structured Data from the Web (2007, methodology): “Instead, we implement a complete index on quads [13] which allows for direct lookups on multiple dimensions without requiring joins.”
• SP^2Bench: A SPARQL Performance Benchmark (2008, background): “These approaches comprise a wide range of optimization techniques, including normal forms [ 4], graph pattern reordering based on selectivity estimations [5] (similar to relational join reordering), syntactic rewrit ing [6], specialized indices [7], [8] and storage schemes [9], [10], [11], [12], [13”