Dataplorer: a scalable search engine for the data web

ABSTRACT

More and more structured information in the form of semantic data is nowadays available. It offers a wide range of new possibilities especially for semantic search and Web data integration. However, their effective exploitation still brings about a number of challenges, e.g. usability, scalability and uncertainty. In this paper, we present Dataplorer, a solution designed to address these challenges. We consider the usability through the use of hybrid queries and faceted search, while still preserving the scalability thanks to an extension of inverted index to support this type of query. Moreover, Dataplorer deals with uncertainty by means of a powerful ranking scheme to find relevant results. Our experimental results show that our proposed approach is promising and it makes us believe that it is possible to extend the current IR infrastructure to query and search the Web of data.

REFERENCES

• 1: Christian Bizer , Tom Heath , Kingsley Idehen , Tim Berners-Lee, Linked data on the web (LDOW2008), Proceeding of the 17th international conference on World Wide Web, April 21-25, 2008, Beijing, China [doi>10.1145/1367497.1367760]
• 2: Ian Horrocks , Sergio Tessaris, Querying the Semantic Web: A Formal Approach, Proceedings of the First International Semantic Web Conference on The Semantic Web, p.177-191, June 09-12, 2002
• 3: L. Zhang, Q. Liu, J. Zhang, H. Wang, Y. Pan, and Y. Yu. Semplore: An IR Approach to Scalable Hybrid Query of Semantic Web Data. In Proc. of ISWC, 2007.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval

General Terms:
Algorithms, Experimentation, Performance

Keywords:
faceted search, hybrid query, inverted index, ranking