Sciweavers

2020 search results - page 184 / 404
» KDD Process Planning
Sort
View
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 8 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
HPDC
2010
IEEE
15 years 6 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
184
Voted
P2P
2006
IEEE
229views Communications» more  P2P 2006»
15 years 11 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 10 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
171
Voted
CIKM
2008
Springer
15 years 7 months ago
Mining social networks using heat diffusion processes for marketing candidates selection
Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social netw...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King