Welcome to DiSC 2003
SIGMOD 2002
PODS 2002
SIGMOD RECORD 2002
ADBIS 2002
CIKM 2002
CoopIS 2002
EDBT 2002
ER 2002
Data Engineering Bul
DEXA_EC-WEB 2002
DMKD 2002
DPDJ 2002
<<< = DPDJ'02 Papers>>>
HYPERTEXT 2002
ICDE 2002
ICDM 2002
JCDL 2002
KDD 2002
KDD_EXPLORATIONS 20
KRDB 2002
MDM 2002
MIS 2002
RIDE 2002
SBBD 2002
SIGIR 2002
SIGIR FORUM 2002
SSDBM 2002
TODS 2002
TIME 2002
VLDB 2002
VLDBJ 2002

Shared State for Distributed Interactive Data Mining Applications


Srinivasan Parthasarathy and Sandhya Dwarkadas



Return to Volume 11, Number 2, Mar 2002


Abstract

stributed data mining applications involving user interaction are now feasible due to advances in processor speed and network bandwidth. These applications are traditionally implemented using ad-hoc communication protocols, which are often either cumbersome or inefficient. This paper presents and evaluates a system for sharing state among such interactive distributed data mining applications, developed with the goal of providing both ease of programming and efficiency. Our system, called InterAct, supports data sharing efficiently by allowing caching, by communicating only the modified data, and by allowing relaxed coherence requirement specification for reduced communication overhead, as well as placement of data for improved locality, on a per client and per data structure basis. Additionally, our system supports the ability to supply clients with consistent copies of shared data even while the data is being modified. We evaluate the performance of the system on a set of data mining applications that perform queries on data structures that summarize information from the databases of interest. We demonstrate that providing a runtime system such as InterAct results in a 10-30 fold improvement in execution time due to shared data caching, the applications' ability to tolerate stale data (client-controlled coherence), and the ability to off-load some of the computation from the server to the client. Performance is improved without requiring complex communication protocols to be built into the application, since the runtime system uses knowledge about application behavior (encoded by specifying coherence requirements) in order to automatically optimize the resources utilized for communication. We also demonstrate that for our benchmark tests, the quality of the results generated is not significantly deteriorated due to the use of more relaxed coherence protocols.


DiSC'03 © 2003 Association for Computing Machinery