38 search results - page 7 / 8 » A paraconsistent logic programming approach for querying inc... |
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
DLOG
2008
13 years 8 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
SAC
2010
ACM
14 years 25 days ago
2010
ACM
Extensive research activities are recently directed towards the Semantic Web as a future form of the Web. Consequently, Web search as the key technology of the Web is evolving tow...
SIGMOD
2001
ACM
14 years 6 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...