33 search results - page 3 / 7 » First-order complete and computationally complete query lang... |
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
ICDT
2012
ACM
11 years 9 months ago
2012
ACM
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
SOFSEM
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
IDEAS
2002
IEEE
14 years 8 days ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...