The complexity of query evaluation in indefinite temporal constraint databases

Author： Koubarakis M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.171, Iss.1, 1997-01, pp. : 25-60

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Query evaluation in probabilistic relational databases

By Zimanyi E.  

Theoretical Computer Science, Vol. 171, Iss. 1, 1997-01 ,pp. : 179-219

Elsevier

Access to resources Recommend Favorite

Complexity studies of a temporal constraint propagation algorithm: a statistical analysis

By Mitra Debasis   Pal Nabendu  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 11, Iss. 2, 1999-04 ,pp. : 155-183

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Design and Evaluation of a Magnetic/Optical Access Structure for Temporal Databases

By Kouramajian V.  

Journal of Systems Integration, Vol. 7, Iss. 1, 1997-01 ,pp. : 47-75

Springer Publishing Company

Access to resources Recommend Favorite

Approximating query answering on RDF databases

By Huang Hai  

World Wide Web, Vol. 15, Iss. 1, 2012-01 ,pp. : 89-114

Springer Publishing Company

Access to resources Recommend Favorite

Query complexity of membership comparable sets

By Tantau T.  

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 467-474

Elsevier

Access to resources Recommend Favorite