Sciweavers

643 search results - page 21 / 129
» Dynamic prioritization of database queries
Sort
View
RR
2007
Springer
14 years 1 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 1 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
SIGMOD
2003
ACM
127views Database» more  SIGMOD 2003»
14 years 7 months ago
Cache-and-Query for Wide Area Sensor Databases
Webcams, microphones, pressure gauges and other sensors provide exciting new opportunities for querying and monitoring the physical world. In this paper we focus on querying wide ...
Amol Deshpande, Suman Kumar Nath, Phillip B. Gibbo...
SIGMOD
2004
ACM
114views Database» more  SIGMOD 2004»
14 years 7 months ago
An initial study of overheads of eddies
An eddy [2] is a highly adaptive query processing operator that continuously reoptimizes a query in response to changing runtime conditions. It does this by treating query process...
Amol Deshpande
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 7 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen