13 search results - page 1 / 3 » Parameterized Complexity for the Database Theorist |
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
DKE
2007
13 years 4 months ago
2007
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
VLDB
1995
ACM
13 years 8 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
ACTA
2002
13 years 4 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...