293 search results - page 7 / 59 » Efficiently Querying Relational Databases Using OWL and SWRL |
GEOINFO
2003
14 years 11 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
DAWAK
1999
Springer
15 years 1 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
100
click to vote
SEMWEB
2009
Springer
15 years 2 months ago
2009
Springer
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
153
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...