Sciweavers

2135 search results - page 68 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
CAISE
2005
Springer
15 years 9 months ago
Estimating Recall and Precision for Vague Queries in Databases
In vague queries, a user enters a value that represents some real world object and expects as the result the set of database values that represent this real world object even with ...
Raquel Kolitski Stasiu, Carlos A. Heuser, Roberto ...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 4 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
SIGMOD
2007
ACM
133views Database» more  SIGMOD 2007»
16 years 4 months ago
Making database systems usable
Database researchers have striven to improve the capability of a database in terms of both performance and functionality. We assert that the usability of a database is as importan...
H. V. Jagadish, Adriane Chapman, Aaron Elkiss, Mag...
SEMWEB
2007
Springer
15 years 10 months ago
Discovering Simple Mappings Between Relational Database Schemas and Ontologies
Ontologies proliferate with the growth of the Semantic Web. However, most of data on the Web are still stored in relational databases. Therefore, it is important to establish inter...
Wei Hu, Yuzhong Qu
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
15 years 8 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...