1588 search results - page 117 / 318 » Consistent query answering in databases |
129
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
133
click to vote
QSIC
2005
IEEE
15 years 10 months ago
2005
IEEE
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
103
click to vote
XSYM
2005
Springer
15 years 10 months ago
2005
Springer
We propose XPathMark, an XPath benchmark on top of the XMark generated data. It consists of a set of queries which covers
165
click to vote
DATESO
2009
15 years 2 months ago
2009
Ontology as a knowledge base can provide different reasoning tasks, e.g. to check consistency of the ontology or to check whether a resource is instance of a concept or not. In thi...
153
click to vote
AAAI
2006
15 years 5 months ago
2006
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...