293 search results - page 16 / 59 » Efficiently Querying Relational Databases Using OWL and SWRL |
195
click to vote
GIS
2005
ACM
16 years 20 days ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
193
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
103
click to vote
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
176
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for "best" tupl...
DAWAK
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...