Sciweavers

293 search results - page 27 / 59
» Efficiently Querying Relational Databases Using OWL and SWRL
Sort
View
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
15 years 12 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
PVLDB
2008
167views more  PVLDB 2008»
14 years 11 months ago
Managing and querying transaction-time databases under schema evolution
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
Hyun Jin Moon, Carlo Curino, Alin Deutsch, Chien-Y...
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 1 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
WWW
2008
ACM
16 years 11 days ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 12 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...