131 search results - page 25 / 27 » Linear Constraint Query Languages: Expressive Power and Comp... |
CIKM
1993
Springer
13 years 11 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
PEPM
2010
ACM
14 years 4 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
To maintain interoperability in the Web environment it is necessary to comply with Web standards. Current specifications of HTML and XHTML languages define conformance conditions ...