![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Zimanyi E.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.171, Iss.1, 1997-01, pp. : 179-219
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The complexity of query evaluation in indefinite temporal constraint databases
Theoretical Computer Science, Vol. 171, Iss. 1, 1997-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Keyword search in relational databases
By Park Jaehui
Knowledge and Information Systems, Vol. 26, Iss. 2, 2011-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Anytime approximation in probabilistic databases
By Fink Robert Huang Jiewen Olteanu Dan
The VLDB Journal, Vol. 22, Iss. 6, 2013-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Approximating query answering on RDF databases
By Huang Hai
World Wide Web, Vol. 15, Iss. 1, 2012-01 ,pp. :