Sciweavers

756 search results - page 96 / 152
» SQL: From Traditional Databases to Big Data
Sort
View
VLDB
1999
ACM
133views Database» more  VLDB 1999»
14 years 1 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
INTERNET
2007
105views more  INTERNET 2007»
13 years 9 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
14 years 2 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
ER
2006
Springer
87views Database» more  ER 2006»
14 years 21 days ago
Spatio-temporal and Multi-representation Modeling: A Contribution to Active Conceptual Modeling
Worldwide globalization increases the complexity of problem solving and decision-making, whatever the endeavor is. This calls for a more accurate and complete understanding of unde...
Stefano Spaccapietra, Christine Parent, Esteban Zi...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen