{"title":"On G-networks and resource allocation in multimedia systems","authors":"E. Gelenbe, H. Shachnai","doi":"10.1109/RIDE.1998.658284","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658284","url":null,"abstract":"Multimedia systems are gaining importance as novel computer and communication system architectures, which are specialized to the storage and transfer of video documents. Consider a multimedia-on-demand server which transmits video documents through a high-speed network, to geographically distributed clients. The server accumulates requests for specific documents in separate queues. The queues need to share the transmission medium in some fashion, typically in Round-Robin mode. We describe the resulting performance modeling problem, and develop an approximate representation using queuing networks. Our analytic model enables the efficient implementation of a new scheduling scheme, that we call the Local Round-Robin (LRR). We show that LRR yields significant improvement in system performance, compared to the original Round-Robin.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133883977","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}
{"title":"Query by rhythm: an approach for song retrieval in music databases","authors":"James C. C. Chen, Arbee L. P. Chen","doi":"10.1109/RIDE.1998.658288","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658288","url":null,"abstract":"We propose techniques for retrieving songs by rhythm from music databases. The rhythm of songs is modeled by rhythm strings. The song retrieval problem is then transformed to the string matching problem. In order to allow approximate string matching, we define similarity measures on rhythm strings. An index structure, called L-tree, is proposed to support efficient sub-string matching. Retrieval algorithms based on L-tree are then designed to provide approximate and sub- song retrieval. Experimental results show that this approach is effective and efficient.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125183851","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}
{"title":"An image retrieval system for distributed environments","authors":"M. Nabil, J. Shepherd, A. Ngu","doi":"10.1109/RIDE.1998.658280","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658280","url":null,"abstract":"We describe a prototype image retrieval system for distributed environments based on 2D projection interval relationships (2D-PIR). The system transforms an image to a symbolic representation that describes spatial relationships among objects in the image. The image database consists of three parts: the real image repository (which is distributed) and the symbolic and iconic image repositories (which are stored locally). We describe the result of experiments on a small image database which compare the performance of our system against a keyword-based retrieval system and also against other content-based image retrieval systems.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132815971","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}
{"title":"Cost-based media server design","authors":"E. Chang, H. Garcia-Molina","doi":"10.1109/RIDE.1998.658281","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658281","url":null,"abstract":"Conventional wisdom holds that reducing disk latency leads to higher disk utilization, maximizing disk utilization leads to higher throughput, and employing a faster disk leads to better performance. All of this is true when building a conventional file or database system. We show that these principles can be misleading when applied to a media server. To design such a server, we propose a cost-based approach that focuses on the per-stream costs. We give various examples to illustrate the design process.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129002821","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}
{"title":"Distributed digital library architecture: the key to success for distance learning","authors":"W. J. Adams, B. Jansen, Richard Howard","doi":"10.1109/RIDE.1998.658272","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658272","url":null,"abstract":"Cost cutting and personnel restructuring are forcing organizations to make difficult decisions on where to spend money. Among the areas hit hard by budget cuts are education and training. Academic, industrial, and governmental institutions are all seeking means to leverage technology to improve the timeliness, efficiency, and standardization of their required training. One way to extend budgets while continuing to deliver training is by constructing distributed digital libraries. A distributed digital library consists of material on separate machines connected via a network. The challenge of managing this information is deciding how to store the information and how users will connect, search and retrieve the material. One method, the monolithic library, forces all user interactions through a single, controlling node of the library network. Another is called the distributed library, which hides the actual server architecture by allowing the user to interact with whichever library node is nearest to him. Using the model of the U.S. Army's Army Training Digital Library as an example, this paper discusses challenges and solutions to indexing, searching and retrieving material from globally distributed digital libraries. In particular, this paper compares the costs and benefits of using a monolithic library structure with that of a distributed digital library.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133498755","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}
{"title":"A scalable approach to continuous-media processing","authors":"Dragos Manolescu, K. Nahrstedt","doi":"10.1109/RIDE.1998.658282","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658282","url":null,"abstract":"Techniques that emphasize software reuse and scalability are becoming more important than ever. We present a component-based model for continuous-media applications. Components encapsulate expert knowledge and facilitate reuse. They provide a toolkit that is used to create a wide range of continuous-media applications. Our model is scalable in several dimensions: media transformations, number of processors, number of configurations, media types, and processing and communication requirements. The paper is organized as a catalog of four software patterns. Developers and researchers working on continuous-media applications can also benefit from and apply software patterns.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115430161","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}
G. Nerjes, Peter Muth, M. Paterakis, Y. Romboyannakis, P. Triantafillou, G. Weikum
{"title":"Scheduling strategies for mixed workloads in multimedia information servers","authors":"G. Nerjes, Peter Muth, M. Paterakis, Y. Romboyannakis, P. Triantafillou, G. Weikum","doi":"10.1109/RIDE.1998.658286","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658286","url":null,"abstract":"In contrast to pure video servers, advanced applications such as digital libraries or teleteaching exhibit a mixed workload with massive access to conventional, \"discrete\" data such as text documents, images and indexes as well as requests for \"continuous data\". In addition to the service quality guarantees for continuous data requests, quality-conscious applications require that the response time of the discrete data requests stay below some user-tolerance threshold. We study the impact of different disk scheduling policies on the service quality for both continuous and discrete data. We identify a number of critical issues, present a framework for describing the various policies in terms of few parameters and finally provide experimental results, based on a detailed simulation testbed, that compare different scheduling policies.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122621931","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}
{"title":"Query processing techniques for multimedia presentation graphs","authors":"Taekyong Lee, G. Özsoyoglu","doi":"10.1109/RIDE.1998.658287","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658287","url":null,"abstract":"Multimedia presentations are stored into and queried from multimedia databases. In an earlier work, we have designed a graphical query language, called GVISUAL, that allows users to query multimedia presentations based on content information. In this paper, we discuss GVISUAL query processing techniques for multimedia presentations. More specifically, we discuss the translation of GVISUAL queries into an operator-based language, called O-Algebra, with three new operators, and efficient implementations of the new O-Algebra operators using a coding system called the nodecode system.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131110159","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}
{"title":"Scene break detection: a comparison","authors":"G. Lupatini, C. Saraceno, R. Leonardi","doi":"10.1109/RIDE.1998.658276","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658276","url":null,"abstract":"The automatic organization of video databases according to the semantic content of data is a key aspect for efficient indexing and fast retrieval of audio-visual material. In order to generate indices that can be used to access a video database, a description of each video sequence is necessary. The identification of objects present in a frame and the track of their motion and interaction in space and time, is attractive but not yet very robust. For this reason, since the early 90's, attempts have been applied in trying to segment a video in shots. For each shot a representative frame of the shot, called k-frame, is usually chosen and the video can be analyzed through its k-frames. Even if abrupt scene changes are relatively easy to detect, it is more difficult to identify special effects, such as dissolve, that were operated in the editing stage to merge two shots. Unfortunately, these special effects are normally used to stress the importance of the scene change (from a content point of view), so they are extremely relevant, therefore they should not be missed. It is very important to determine precisely the beginning and the end of the transition in the case of dissolves and fades. In this work, two new parameters are proposed. These characterize the precision of boundaries of special effects when the scene change involves more than two frames. They are combined with the common recall and precision parameters. Three types of algorithms for cut detection are considered: histogram-based, motion-based and contour-based. These algorithms are tested and compared on several video sequences. Results show that the best performance is achieved by the global histogram-based method which uses color information.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131476776","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}
{"title":"Performance enhancement using intra-server caching in a continuous media server","authors":"C. Srinilta, A. Choudhary","doi":"10.1109/RIDE.1998.658279","DOIUrl":"https://doi.org/10.1109/RIDE.1998.658279","url":null,"abstract":"Continuity of stream playback is the crucial constraint in designing a continuous media server. From a distributed memory architectural model developed earlier, we found that there were many points where the stream capacity of the server could be improved. The stream capacity was usually limited by the storage bottlenecks. Serving streams from memory cache eliminates disk accesses and data transfers between nodes which, in turn, helps relieve those bottlenecks. However, the capacity of the server ultimately depends on client access patterns. Client request assignment has an impact on cache hit ratio as well as workload distribution. It is also the major factor reflecting the server performance. In some cases where lower playback quality at some point in time is acceptable, delays can be added to improve the missed packet rate. This paper proposes various techniques to enhance the server performance and shows their reflections under different circumstances. Some techniques work well together. The best combination improves the capacity of the server by approximately 30%.","PeriodicalId":199347,"journal":{"name":"Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132760032","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}