A Complexity Model For Web Queries

Autor:	Lawrence V. Saxton, Tao Guan
Rok vydání:	1999
Předmět:	Theoretical computer science Computer science Web query classification Computer Science::Information Retrieval Complexity class Worst-case complexity Game complexity Descriptive complexity theory Communication complexity Computer Science::Databases Decision tree model Sparse language
Zdroj:	Fundamentals of Information Systems ISBN: 9781461373384 FMLDO
DOI:	10.1007/978-1-4615-5137-9_5
Popis:	A new complexity model for web queries is presented in this paper. The novelties of this model are: (1) the communication cost is considered; (2) the complexity of a web query is partitioned into the accessing complexity and the constructing complexity; (3) the classical complexity classes of queries are redefined. The upper bound of this model is the class TAC-Computable. A language which captures exactly the class is presented.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::69d4d78e8cd4880051fd5d7cf279efdd https://doi.org/10.1007/978-1-4615-5137-9_5 Zobrazit plný text záznamu