293 search results - page 21 / 59 » Efficiently Querying Relational Databases Using OWL and SWRL |
194
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
169
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a valid-time extension of SQL and investigate its efficient implementation on an Object-Relational database system. We propose an approach where temporal queries are ex...
115
click to vote
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
VLDB
1998
ACM
15 years 3 months ago
1998
ACM
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
203
Voted
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...