293 search results - page 8 / 59 » Efficiently Querying Relational Databases Using OWL and SWRL |
106
click to vote
DEXA
2006
Springer
15 years 3 months ago
2006
Springer
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
JIIS
2000
14 years 11 months ago
2000
Abstract. 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 effi...
172
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
103
click to vote
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
XML has emerged as the standard data exchange format for Internet-based business applications. This has created the need to publish existing business data, stored in relational da...
211
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...