Sciweavers

67 search results - page 11 / 14
» Computing Join Aggregates over Private Tables
Sort
View
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 7 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 24 days ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
ICPR
2010
IEEE
13 years 5 months ago
A Practical Heterogeneous Classifier for Relational Databases
Most enterprise data is distributed in multiple relational databases with expert-designed schema. Using traditional single-table machine learning techniques over such data not onl...
Geetha Manjunath, M. Narasimha Murty, Dinkar Sitar...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
ATAL
2006
Springer
13 years 11 months ago
Efficient agent-based models for non-genomic evolution
Modeling dynamical systems composed of aggregations of primitive proteins is critical to the field of astrobiological science, which studies early evolutionary structures dealing ...
Nachi Gupta, Adrian K. Agogino, Kagan Tumer