作者: Olaf Hartig
DOI: 10.1007/978-3-642-21034-1_11
关键词: Query expansion 、 Query optimization 、 Web query classification 、 Distributed computing 、 Sargable 、 RDF query language 、 Theoretical computer science 、 Web search query 、 Query plan 、 Computer science 、 Query language
摘要: Link traversal based query execution is a new paradigm for the Web of Data. This approach allows engine to discover potentially relevant data during and, thus, enables users tap full potential Web. In earlier work we propose implement idea link using synchronous pipeline iterators. While this an easy and efficient implementation, it introduces restrictions that cause less comprehensive result sets. paper address limitation. We analyze discuss how evaluation order may affect set size costs. To identify suitable order, heuristic our scenario where no a-priory information about sources present. evaluate by executing real-world queries over