Sciweavers

121 search results - page 20 / 25
» First-Order Queries over One Unary Function
Sort
View
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 1 months ago
Mining Views: Database Views for Data Mining
We present a system towards the integration of data mining into relational databases. To this end, a relational database model is proposed, based on the so called virtual mining vi...
Élisa Fromont, Adriana Prado, Bart Goethals...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 3 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 2 days ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...
84
Voted
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 4 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
80
Voted
BTW
2009
Springer
166views Database» more  BTW 2009»
15 years 6 months ago
TinTO: A Tool for View-Based Analysis of Stock Market Data Streams
: TinTO is an experimental system aiming at demonstrating the usefulness and feasibility of incrementally evaluated SQL queries for analyzing a wide spectrum of data streams. As ap...
Andreas Behrend, Christian Dorau, Rainer Manthey