Sciweavers

750 search results - page 98 / 150
» Aggregates in Possibilistic Databases
Sort
View
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 4 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
ACMSE
2009
ACM
14 years 4 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
CEC
2008
IEEE
14 years 4 months ago
Distributed multi-relational data mining based on genetic algorithm
—An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules i...
Wenxiang Dou, Jinglu Hu, Kotaro Hirasawa, Gengfeng...
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
14 years 3 months ago
A Nested Relational Approach to Processing SQL Subqueries
One of the most powerful features of SQL is the use of nested queries. Most research work on the optimization of nested queries focuses on aggregate subqueries. However, the solut...
Bin Cao, Antonio Badia
DOLAP
2004
ACM
14 years 3 months ago
PrefixCube: prefix-sharing condensed data cube
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
Jianlin Feng, Qiong Fang, Hulin Ding