Sciweavers

4113 search results - page 122 / 823
» Watermarking Relational Databases
Sort
View
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 3 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
126
Voted
GIS
2009
ACM
15 years 10 months ago
Topological relations from metric refinements
Naive Geography’s premise “Topology matters, metric refines” calls for metric properties that provide opportunities for finergrained distinctions than the purely qualitative...
Max J. Egenhofer, Matthew P. Dube
117
Voted
ADC
2006
Springer
120views Database» more  ADC 2006»
15 years 9 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
157
Voted
AIIA
2005
Springer
15 years 9 months ago
Mining Relational Association Rules for Propositional Classification
In traditional classification setting, training data are represented as a single table, where each row corresponds to an example and each column to a predictor variable or the targ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
97
Voted
VLDB
2005
ACM
93views Database» more  VLDB 2005»
15 years 9 months ago
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
Vuk Ercegovac, David J. DeWitt, Raghu Ramakrishnan