272 search results - page 5 / 55 » SQL Queries Over Unstructured Text Databases |
CIKM
2011
Springer
12 years 6 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
DLOG
2011
2011
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
12 years 10 months ago
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
VLDB
2005
ACM
13 years 12 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...
IDEAS
2005
IEEE
14 years 12 hour ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
We study the problem of auditing a batch of SQL queries: Given a forbidden view of a database that should have been kept confidential, a batch of queries that were posed over this ...