Sciweavers

293 search results - page 11 / 59
» Efficiently Querying Relational Databases Using OWL and SWRL
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 3 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ER
2003
Springer
148views Database» more  ER 2003»
15 years 4 months ago
Improving Query Performance Using Materialized XML Views: A Learning-Based Approach
We consider the problem of improving the efficiency of query processing on an XML interface of a relational database, for predefined query workloads. The main contribution of this ...
Ashish Shah, Rada Chirkova
ICDE
2007
IEEE
89views Database» more  ICDE 2007»
15 years 3 months ago
A Flexible Query Graph Based Model for the Efficient Execution of Continuous Queries
In this paper, we propose a simple and flexible execution model that (i) supports a wide spectrum of alternative optimization and execution strategies and their mixtures, (ii) pro...
Yijian Bai, Hetal Thakkar, Haixun Wang, Carlo Zani...
INFORMATICALT
2008
162views more  INFORMATICALT 2008»
14 years 11 months ago
Vague Rough Set Techniques for Uncertainty Processing in Relational Database Model
Abstract. The study of databases began with the design of efficient storage and data sharing techniques for large amount of data. This paper concerns the processing of imprecision ...
Karan Singh, Samajh Singh Thakur, Mangi Lal
ICDE
1995
IEEE
164views Database» more  ICDE 1995»
16 years 29 days ago
Efficient Processing of Nested Fuzzy SQL Queries
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
Qi Yang, Chengwen Liu, Jing Wu, Clement T. Yu, Son...