Sciweavers

242 search results - page 38 / 49
» Joining Interval Data in Relational Databases
Sort
View
PVLDB
2010
158views more  PVLDB 2010»
13 years 6 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 27 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
PVLDB
2011
12 years 10 months ago
CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop
Hadoop has become an attractive platform for large-scale data analytics. In this paper, we identify a major performance bottleneck of Hadoop: its lack of ability to colocate relat...
Mohamed Y. Eltabakh, Yuanyuan Tian, Fatma Özc...
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 9 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
ICDE
2003
IEEE
122views Database» more  ICDE 2003»
14 years 9 months ago
XML Publishing: Look at Siblings too!
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...
Sihem Amer-Yahia, Yannis Kotidis, Divesh Srivastav...