51 search results - page 4 / 11 » Optimizing relational store for e-catalog queries: a data mi... |
RR
2007
Springer
14 years 25 days ago
2007
Springer
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...
DKE
2006
13 years 6 months ago
2006
Recursive queries are quite important in the context of XML databases. In addition, several recent papers have investigated a relational approach to store XML data and there is gr...
IAJIT
2010
13 years 5 months ago
2010
: A broad variety of data is available in distinct heterogeneous sources, stored under different formats: database formats (in relational and object-oriented models), document form...
DAWAK
1999
Springer
13 years 11 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...