552 search results - page 25 / 111 » On the Complexity of Join Predicates |
IJCAI
1997
13 years 11 months ago
1997
We study complexity of methods using rigid variables, like the method of matings or the tableau method, on a decidable class of predicate calculus with equality. We show some intr...
SKG
2006
IEEE
14 years 4 months ago
2006
IEEE
The paper studies “equality” in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD ...
PODS
2003
ACM
14 years 10 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
EDBT
2002
ACM
14 years 10 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
COLING
1990
13 years 11 months ago
1990
: CLG(2) is the latest member of a family of grammar formalisms centered around the notion of complex constraint expression for describing phrasal and iexical information and princ...