Web searching and Σ2 queries


Autoria(s): Sharma, Arun
Contribuinte(s)

Yu, Jeffrey Xu

Lin, Xuemin

Lu , Hongjun

Zhang, Yanchun

Data(s)

2004

Resumo

In the terminology of Logic programming, current search engines answer Sigma1 queries (formulas of the form where is a boolean combination of attributes). Such a query is determined by a particular sequence of keywords input by a user. In order to give more control to users, search engines will have to tackle more expressive queries, namely, Sigma2 queries (formulas of the form ). The purpose of the talk is to examine which directions could be explored in order to move towards more expressive languages, more powerful search engines, and the benefits that users should expect.

Identificador

http://eprints.qut.edu.au/37251/

Publicador

Springer-Verlag

Relação

DOI:10.1007/978-3-540-24655-8_3

Sharma, Arun (2004) Web searching and Σ2 queries. In Yu, Jeffrey Xu, Lin, Xuemin, Lu , Hongjun, & Zhang, Yanchun (Eds.) Advanced Web Technologies and Applications : proceedings of the 6th Asia-Pacific Web Conference, Springer-Verlag , Hangzhou, China, pp. 20-23.

Fonte

Division of Research and Commercialisation

Palavras-Chave #080500 DISTRIBUTED COMPUTING
Tipo

Conference Paper