Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836496
J. Holliday, D. Agrawal, A. E. Abbadi
We present the notion of a distributed database made up entirely of mobile components. Since disconnections will be frequent in such an environment, we develop a disconnection and reconnection procedure to allow normal processing on the connected components. We briefly discuss a protocol based on epidemic communication to support such a system while ensuring one-copy serializability.
{"title":"Exploiting planned disconnections in mobile environments","authors":"J. Holliday, D. Agrawal, A. E. Abbadi","doi":"10.1109/RIDE.2000.836496","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836496","url":null,"abstract":"We present the notion of a distributed database made up entirely of mobile components. Since disconnections will be frequent in such an environment, we develop a disconnection and reconnection procedure to allow normal processing on the connected components. We briefly discuss a protocol based on epidemic communication to support such a system while ensuring one-copy serializability.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121087323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836499
K. Munakata, Masatoshi Yoshikawa, Shunsuke Uemura
Presents frameworks for acquiring data from servers that broadcast data periodically at constant intervals. We assume that different servers broadcast data for different periods at different intervals, and our focus is on choosing a fresh and synchronous combination of data, each obtained from a different server. We define an evaluation function to determine which data combination to use, taking into account both the freshness and the synchronousness of the data. Then we present a data acquisition framework for consecutive queries. For efficiency, the points of time that give the optimum data combinations are pre-computed. We show the pre-computation results can also be used for interactive queries which enable application programs to set limits on the data synchronousness and response time.
{"title":"Integrating periodic data sequences based on freshness and synchronousness","authors":"K. Munakata, Masatoshi Yoshikawa, Shunsuke Uemura","doi":"10.1109/RIDE.2000.836499","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836499","url":null,"abstract":"Presents frameworks for acquiring data from servers that broadcast data periodically at constant intervals. We assume that different servers broadcast data for different periods at different intervals, and our focus is on choosing a fresh and synchronous combination of data, each obtained from a different server. We define an evaluation function to determine which data combination to use, taking into account both the freshness and the synchronousness of the data. Then we present a data acquisition framework for consecutive queries. For efficiency, the points of time that give the optimum data combinations are pre-computed. We show the pre-computation results can also be used for interactive queries which enable application programs to set limits on the data synchronousness and response time.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115123106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836498
Kyong-I Ku, Yoo-Sung Kim
Users on mobile hosts can access information from heterogeneous multidatabase systems by mobile transactions via wireless communication. Hence, a mobile transaction model should include not only features for heterogeneous multidatabase systems but also those for a mobile computing environment. In this paper, we propose a mobile transaction model to support the requirements of mobile heterogeneous multidatabase systems. The proposed Moflex (Mobile flexible) transaction model is able to support the management of mobility, heterogeniety and flexibility in the definition and execution of mobile transactions. Hence, the Moflex transaction model can be suitable for mobile heterogeneous multidatabase systems that have low power capability, low bandwidth and a high possibility of communication failure.
{"title":"Moflex transaction model for mobile heterogeneous multidatabase systems","authors":"Kyong-I Ku, Yoo-Sung Kim","doi":"10.1109/RIDE.2000.836498","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836498","url":null,"abstract":"Users on mobile hosts can access information from heterogeneous multidatabase systems by mobile transactions via wireless communication. Hence, a mobile transaction model should include not only features for heterogeneous multidatabase systems but also those for a mobile computing environment. In this paper, we propose a mobile transaction model to support the requirements of mobile heterogeneous multidatabase systems. The proposed Moflex (Mobile flexible) transaction model is able to support the management of mobility, heterogeniety and flexibility in the definition and execution of mobile transactions. Hence, the Moflex transaction model can be suitable for mobile heterogeneous multidatabase systems that have low power capability, low bandwidth and a high possibility of communication failure.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126900499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836494
M. Butrico, N. Cohen, John S. Givler, A. Mohindra, A. Purakayastha, D. Shea, Josephine M. Cheng, Don Clare, G. Fisher, Rob Scott, Yudong Sun, M. Wone, Quinton Zondervan
Currently, hand-held and palmtop computers are widely used for personal information management. In the near future, they will also be used to access enterprise data. There are however, numerous technical challenges in enabling an end-to-end system that provides enterprise data access from mobile computers. The challenges include heterogeneity, various resource constraints, scalability and security. In this paper, we describe the design and implementation of the Mobile Data Synchronization Service (MDSS), an end-to-end system that provides enterprise data access from mobile computers. Specifically, we address the heterogeneity of devices and data sources, the memory and power constraints of devices, the poor quality of communication and the need for scalability. Our system achieves interoperability and solves the key technical challenges related to enterprise data access from mobile computers.
{"title":"Enterprise data access from mobile computers: an end-to-end story","authors":"M. Butrico, N. Cohen, John S. Givler, A. Mohindra, A. Purakayastha, D. Shea, Josephine M. Cheng, Don Clare, G. Fisher, Rob Scott, Yudong Sun, M. Wone, Quinton Zondervan","doi":"10.1109/RIDE.2000.836494","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836494","url":null,"abstract":"Currently, hand-held and palmtop computers are widely used for personal information management. In the near future, they will also be used to access enterprise data. There are however, numerous technical challenges in enabling an end-to-end system that provides enterprise data access from mobile computers. The challenges include heterogeneity, various resource constraints, scalability and security. In this paper, we describe the design and implementation of the Mobile Data Synchronization Service (MDSS), an end-to-end system that provides enterprise data access from mobile computers. Specifically, we address the heterogeneity of devices and data sources, the memory and power constraints of devices, the poor quality of communication and the need for scalability. Our system achieves interoperability and solves the key technical challenges related to enterprise data access from mobile computers.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132922482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836493
Sven Buchholz, T. Ziegert, A. Schill, A. Held
Previous research in mobile data management has been focused on scenarios where mobile clients replace fixed ones. However, not all potential application fields of mobile computing fit into this scenario. There exist scenarios where mobile clients will not replace but accompany fixed ones. In this paper, we introduce a real-world application scenario requiring the capability to process a transaction from alternating, potentially mobile client hosts. With this scenario in mind, we have developed three approaches for supporting multiple clients in combination with a so-called TXAgent (Transaction Processing Agent), which is an object in the fixed network which manages transactions on behalf of the client, and an approach to realise the client as a migrating object. Finally, we present a prototype implementation of the most promising approach.
{"title":"Transaction processing in a mobile computing environment with alternating client hosts","authors":"Sven Buchholz, T. Ziegert, A. Schill, A. Held","doi":"10.1109/RIDE.2000.836493","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836493","url":null,"abstract":"Previous research in mobile data management has been focused on scenarios where mobile clients replace fixed ones. However, not all potential application fields of mobile computing fit into this scenario. There exist scenarios where mobile clients will not replace but accompany fixed ones. In this paper, we introduce a real-world application scenario requiring the capability to process a transaction from alternating, potentially mobile client hosts. With this scenario in mind, we have developed three approaches for supporting multiple clients in combination with a so-called TXAgent (Transaction Processing Agent), which is an object in the fixed network which manages transactions on behalf of the client, and an approach to realise the client as a migrating object. Finally, we present a prototype implementation of the most promising approach.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836497
Jin Jing, K. E. Huff, B. Hurwitz, Himanshu Sinha, Bill Robinson, M. Feblowitz
We have prototyped a system called WHAM (Workflow enHAncements for Mobility) to support a mobile workforce and applications in workflow environments. The goal of WHAM is to effectively handle the constraints of network connectivity and the mobility of workflow resources for workflow applications. In this paper, we describe the design and architecture of WHAM. We also describe the mobile resource management approach introduced in WHAM to support the adaptability and scalability of resource management for location-dependent activities.
我们创建了一个名为WHAM (Workflow enHAncements for Mobility)的系统原型，以支持工作流环境中的移动员工和应用程序。工作流管理的目标是有效地处理工作流应用的网络连接约束和工作流资源的移动性。在本文中，我们描述了WHAM的设计和架构。我们还描述了在WHAM中引入的移动资源管理方法，以支持依赖于位置的活动的资源管理的适应性和可扩展性。
{"title":"WHAM: supporting mobile workforce and applications in workflow environments","authors":"Jin Jing, K. E. Huff, B. Hurwitz, Himanshu Sinha, Bill Robinson, M. Feblowitz","doi":"10.1109/RIDE.2000.836497","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836497","url":null,"abstract":"We have prototyped a system called WHAM (Workflow enHAncements for Mobility) to support a mobile workforce and applications in workflow environments. The goal of WHAM is to effectively handle the constraints of network connectivity and the mobility of workflow resources for workflow applications. In this paper, we describe the design and architecture of WHAM. We also describe the mobile resource management approach introduced in WHAM to support the adaptability and scalability of resource management for location-dependent activities.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115106697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836501
N. Pissinou, K. Makki, B. König-Ries
Mobile computing is becoming more and more pervasive, liberating users from the confines of wired networks. At the same time, transparent access to heterogeneous, distributed information sources has become a reality in wired computing. Obviously, this kind of access is highly desirable for mobile users, too. However, current architectures for transparent information access do not take the specific needs of mobile users into account, while existing architectures for mobile computing do not support transparent access well. For the future growth of the usage of mobile computing, it is of utmost importance that, instead of individually-developed, isolated extensions to the existing architectures, the research community agrees on a strong, standardized middleware platform extending both existing mobile architectures and existing information access architectures to ensure mobile access in heterogeneous environments. In this paper, we propose such a platform.
{"title":"A middleware-based architecture to support transparent data access by mobile users in heterogeneous environments","authors":"N. Pissinou, K. Makki, B. König-Ries","doi":"10.1109/RIDE.2000.836501","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836501","url":null,"abstract":"Mobile computing is becoming more and more pervasive, liberating users from the confines of wired networks. At the same time, transparent access to heterogeneous, distributed information sources has become a reality in wired computing. Obviously, this kind of access is highly desirable for mobile users, too. However, current architectures for transparent information access do not take the specific needs of mobile users into account, while existing architectures for mobile computing do not support transparent access well. For the future growth of the usage of mobile computing, it is of utmost importance that, instead of individually-developed, isolated extensions to the existing architectures, the research community agrees on a strong, standardized middleware platform extending both existing mobile architectures and existing information access architectures to ensure mobile access in heterogeneous environments. In this paper, we propose such a platform.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"24 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128457535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836495
U. Çetintemel, P. Keleher
Discusses the currency management mechanisms used in Deno, a replicated-object storage system designed for use in mobile and weakly-connected environments. Deno primarily differs from previous work in implementing an asynchronous weighted-voting scheme via epidemic information flow, and in committing updates in an entirely decentralized fashion, without requiring any server to have complete knowledge of system membership. We first give an overview of Deno, briefly discussing its voting scheme, proxy mechanism, basic API and commit performance. We then present currency management mechanisms, based on peer-to-peer currency exchanges, that enable lightweight replica creation, retirement and currency redistribution while maintaining protocol correctness. We also demonstrate that peer-to-peer currency exchanges can be used to exponentially converge to arbitrary target currency distributions.
{"title":"Light-weight currency management mechanisms in Deno","authors":"U. Çetintemel, P. Keleher","doi":"10.1109/RIDE.2000.836495","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836495","url":null,"abstract":"Discusses the currency management mechanisms used in Deno, a replicated-object storage system designed for use in mobile and weakly-connected environments. Deno primarily differs from previous work in implementing an asynchronous weighted-voting scheme via epidemic information flow, and in committing updates in an entirely decentralized fashion, without requiring any server to have complete knowledge of system membership. We first give an overview of Deno, briefly discussing its voting scheme, proxy mechanism, basic API and commit performance. We then present currency management mechanisms, based on peer-to-peer currency exchanges, that enable lightweight replica creation, retirement and currency redistribution while maintaining protocol correctness. We also demonstrate that peer-to-peer currency exchanges can be used to exponentially converge to arbitrary target currency distributions.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126414260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836502
Y. Saygin, Ö. Ulusoy, A. Elmagarmid
One of the features that a mobile computer should provide is disconnected operation which is performed by hoarding. The process of hoarding can be described as loading the data items needed in the future to the client cache prior to disconnection. Automated hoarding is the process of predicting the hoard set without any user intervention. We describe an application independent and generic technique for determining what should be hoarded prior to disconnection. Our method utilizes association rules that are extracted by data mining techniques for determining the set of items that should be hoarded to a mobile computer prior to disconnection. The proposed method was implemented and tested on synthetic data to estimate its effectiveness. Performance experiments determined that the proposed rule-based methods are effective in improving the system performance in terms of the cache hit ratio of mobile clients especially for small cache sizes.
{"title":"Association rules for supporting hoarding in mobile computing environments","authors":"Y. Saygin, Ö. Ulusoy, A. Elmagarmid","doi":"10.1109/RIDE.2000.836502","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836502","url":null,"abstract":"One of the features that a mobile computer should provide is disconnected operation which is performed by hoarding. The process of hoarding can be described as loading the data items needed in the future to the client cache prior to disconnection. Automated hoarding is the process of predicting the hoard set without any user intervention. We describe an application independent and generic technique for determining what should be hoarded prior to disconnection. Our method utilizes association rules that are extracted by data mining techniques for determining the set of items that should be hoarded to a mobile computer prior to disconnection. The proposed method was implemented and tested on synthetic data to estimate its effectiveness. Performance experiments determined that the proposed rule-based methods are effective in improving the system performance in terms of the cache hit ratio of mobile clients especially for small cache sizes.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-02-27DOI: 10.1109/RIDE.2000.836500
Eetu Ojanen, J. Veijalainen
The rapid technical development of wireless cellular networks and the strong proliferation of hand-held mobile terminals among users, on the one hand, and the development of Internet technologies, on the other hand, have made evident the need to combine these technologies. In 1997, an industry-driven organization called the WAP (Wireless Application Protocol) Forum was established to develop technical standards that bridge the gap between the mobile telephone networks and the World Wide Web. The first version (1.0) of the WAP standard was accepted by the Forum in April 1998, and the current version (1.1) in June 1999. Version 1.2 is now being developed. Mobile terminals are small in size, have a relatively small memory and processor capacity, and have small batteries. The wireless bandwidth in GSM and other similar second-generation networks is also rather limited as compared to wire-line networks, ranging from 9.6 to /spl sim/170 kbps. In this paper, we examine how much the byte codes used in the WAP environment can be compressed and whether the reduced transmission time of the application data warrants the increased memory and processor overhead caused by the compression and decompression.
{"title":"Compressibility of WML and WMLScript byte code: initial results [Wireless Mark-up Language]","authors":"Eetu Ojanen, J. Veijalainen","doi":"10.1109/RIDE.2000.836500","DOIUrl":"https://doi.org/10.1109/RIDE.2000.836500","url":null,"abstract":"The rapid technical development of wireless cellular networks and the strong proliferation of hand-held mobile terminals among users, on the one hand, and the development of Internet technologies, on the other hand, have made evident the need to combine these technologies. In 1997, an industry-driven organization called the WAP (Wireless Application Protocol) Forum was established to develop technical standards that bridge the gap between the mobile telephone networks and the World Wide Web. The first version (1.0) of the WAP standard was accepted by the Forum in April 1998, and the current version (1.1) in June 1999. Version 1.2 is now being developed. Mobile terminals are small in size, have a relatively small memory and processor capacity, and have small batteries. The wireless bandwidth in GSM and other similar second-generation networks is also rather limited as compared to wire-line networks, ranging from 9.6 to /spl sim/170 kbps. In this paper, we examine how much the byte codes used in the WAP environment can be compressed and whether the reduced transmission time of the application data warrants the increased memory and processor overhead caused by the compression and decompression.","PeriodicalId":113544,"journal":{"name":"Proceedings Tenth International Workshop on Research Issues in Data Engineering. RIDE 2000","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：