Sciweavers

11573 search results - page 203 / 2315
» Designing Relational Databases
Sort
View
DKE
2007
119views more  DKE 2007»
15 years 6 months ago
XML subtree reconstruction from relational storage of XML documents
Numerous researchers have proposed to use relational databases to store and query XML documents. In these systems, the elements selected by an XML query are returned to an applica...
Artem Chebotko, Mustafa Atay, Shiyong Lu, Farshad ...
KDD
1995
ACM
139views Data Mining» more  KDD 1995»
15 years 10 months ago
Resource and Knowledge Discovery in Global Information Systems: A Preliminary Design and Experiment
Eficient and efiective discovery of resource and knowledge from the Internet has become an imminent research issue, especially with the advent of the Information Super-Highway. A ...
Osmar R. Zaïane, Jiawei Han
ICDE
1995
IEEE
99views Database» more  ICDE 1995»
16 years 7 months ago
Record Subtyping in Flexible Relations by Means of Attribute Dependencies
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
Christian Kalus, Peter Dadam
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 6 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...
ADC
2006
Springer
120views Database» more  ADC 2006»
16 years 16 days 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 ...