S. Berson, S. Ghandeharizadeh, R.R. Muntz and X. Ju, \Staggered Striping in Multimedia Information Systems," Proceedings of ACM SIGMOD '94, pp. 79-90, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....scheme. 2 Sliding Window Algorithm For completeness we describe the algorithm [8] that applies to the case of identical disks with unit size items. We keep the data items in a sorted list in nondecreasing order of the number of clients requiring that data item, denoted by R. The list, R[1]; R[m] 1 m M , is updated during the algorithm. At step j, we assign items to disk d j . For the sake of notation simpli cation, R[i] always refers to the number of currently unassigned clients for a particular data item (i.e. we do not explicitly indicate the current step j of the ....

....is re inserted into the list R. It could happen that no such sequence of items is available, i.e. all data items have relatively few clients. In this case, we greedily select the data items with the largest number of clients to ll d j . The selection procedure is as follows: we rst examine R[1], which is the data item with the smallest number of clients. If these clients exceed the load capacity, we will assign R[1] to the rst disk and re locate the remaining piece of R[1] which for R[1] will always be the beginning of the list) If not, we examine the total demand of R[1] and R[2] ....

[Article contains additional citation context not shown here]

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, pages 79-90, 1994.

....block size is determined such that the playout time of each block is the same as the round length and CTL blocks are striped across multiple disks. Hence, only one block is retrieved for each stream from one disk in a round, which decreases average seek overhead. Staggered striping, proposed in [2], divides each object into a sequence of subobjects and each subobject is divided into multiple fragments. Contiguous blocks are striped into the multiple fragments in a round robin manner and each fragment is stored in a separate disk so that contiguous blocks are retrieved simultaneously from ....

Berson, S., R. Muntz, S. Ghandeharizadeh, and X. Ju: 1994, 'Staggered striping in multimedia information systems'. SIGMOD Record 23(2), 79 90.

....data placement policies have been studied so as to increase the success ratio of user requests. Therefore, most studies were continued to get the high disk bandwidth. Data Striping method is the representative placement policy. The famous striping methods are round robin, random[3] staggered[7], permutation striping[8] and etc. And then, the policies to prevent disk bottleneck, such as dynamic replica policy[5] and data placement policy based on popularity were proposed. But these policies considered only disk conditions based on data popularity. But in these days, since almost all ....

S. Berson, R. Muntz, S. Ghandeharizadeh, X. Ju, "Staggered Striping in Multimedia Information Systems", SIGMOD Conference, pp. 79-90, 1994.

....of this problem will be presented later. Smoothing schemes transmit all or part of the high bit rate frames to the client in advance when the bit rate of the current frame is relatively low, in order to reduce the overall di erence between the amounts of data transmitted in di erent time periods[2, 4, 10, 1, 9, 7]. If too much data is transmitted in advance, the client bu er can over ow. Hence, the smoothing scheme should know the size of the client bu er before determining the transmission schedule, which disables o line deterministic smoothing. Previous studies of deterministic smoothing did not ....

S. Berson, R. Muntz, S. Ghandeharizadeh, and X. Ju. Staggered striping in multimedia information systems. SIGMOD Record, 23(2):79-90, 1994.

....issue creates a strong case for storage of variable bit rate streams, and makes the results of the present paper indispensable part of our previous published work. The related work from media server research is mostly focused on fault tolerance techniques when striping constant bit rate streams [5, 6, 32]. Disks are grouped into clusters, and data blocks from separate disks in each cluster are combined with a parity block to form parity groups. The blocks of a parity group are considered to be retrieved and transmitted in one or multiple rounds, and the parity blocks are stored on data disks or ....

Berson, S., Ghandeharizadeh, S., Muntz, R., and Ju, X. Staggered Striping in Multimedia Information Systems. In ACM SIGMOD Conference (Minneapolis, MN, May 1994), pp. 79--90.

.... An appropriate candidate for SS appears to be arrays of magnetic disks [PGK88] Given the high bandwidth requirements of many multimedia objects and the typical, relatively low, effective bandwidth of magnetic disks (nominal bandwidths are in the range of 4 15 MB sec) striping techniques [SGM86,BMGJ94,TF98] are likely to prove beneficial, since, when striping objects across several disks, the effective SS bandwidth for these objects is several tape CDROM based elevate disk based (elevate) Figure 1. Conceptual model of a Hierarchical Storage Management System (HSMS) times that of a ....

....choice for the SS medium. Researchers in multimedia and video storage servers then started paying attention to the placement of multimedia data on SS devices in such a way so to increase the system s performance by effectively utilizing the available SS bandwidth of the system [RV93,LS93,GR,Tea93,BMGJ94,KK95, ORS96,TF98] Another thread concentrated on developing techniques to reduce the number of required secondary storage I O s by exploiting main memory buffer caches and the characteristics of several emerging applications (such as video on demand servers) Through buffer and data sharing ....

[Article contains additional citation context not shown here]

Steven Berson, Richard Muntz, Shahram Ghandeharizadeh, and Xiangyu Ju. Staggered striping in multimedia information systems. In Richard T. Snodgrass and Marianne Winslett, editors, Proc. ACM SIGMOD Conference, Minneapolis, MN (ACM SIGMOD Record, 23(2), June

....admission control strategies, real time support, etc. 5, 10, 16, 19, 6] Most research works assumed single disk storage system. Several research projects investigated the design techniques for parallel video servers [15, 4, 13, 18, 14, 7, 11] Video data stripping schemes have been studied [15, 1, 5, 10, 7, 11]. However, video stream scheduling problem has not been formally addressed. Many systems rely on statistical multiplexing which cannot truly guarantee the Quality of Service. The system resources cannot be fully utilized without a sophisticated scheduling strategy. Not arranging the video streams ....

S. Berson, S Ghandeharizadeh, R. Muntz, and X. Ju. Staggered striping in multimedia information systems. In The fifth Int'l conf. on management of data, May 1994.

....Disks) 1] an I O request is divided into several sub requests that access different disks. In particular, if there are I O requests for multimedia data, the I O request will be divided into a number of sub requests, and the sub requests will access the disk arrays periodically for a long time [2, 3]. Generally, to increase the disk throughput, some optimization algorithms such as SCAN or CSCAN are used in disk scheduling. However, since such algorithms optimize the disk latency only for a single disk, and do not consider the effect of periodic accesses, the throughput cannot be fully ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACMSIGMOD International Conference on Management of Data, pages 79--89, June 1994.

....array experiences failures. The most widely considered approaches for this problem are based on RAID 5 or RAID 3 data layouts [21] The staggered striping data organization of Berson, Ghandeharizadeh, Muntz and Ju provides effective disk bandwidth utilization for both small and large workloads [4]. The video servers studied by Berson, Golubchik and Muntz [3] employ a RAID 5 data layout and utilize a modified and expanded read schedule in degraded mode requiring additional buffering. There can be transition difficulties in which data is not delivered on time. A method proposed by Vin, ....

Berson, S., R.R. Muntz, S. Gandeharizadeh, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD Record, 23(2), pp. 79-90, 1994.

....balancing characteristics. disk 1 disk 2 disk J A 1 C 2 B j A 2 C 3 B 1 A i C 1 B j 1 Object B= B 1 ,B 2 , B j Object A= A 1 ,A 2 , A i Object C= C 1 ,C 2 , C k Figure 1: Objects striped across disks. In the recent past, a great deal of CM server designs, e.g. as in [2, 10, 14], have focused on wide data striping techniques, where each object is striped across all the disks of the system, i.e. disk 1 through disk J, as illustrated in Figure 1. The potential load imbalance is largely due to the skews in data access patterns which, without data striping, could result ....

.... such as video, we must insure that there is no jitter in the delivery of objects, which also reflects on the dynamic replication policies (real time constraints are not a consideration in the above mentioned works) Much research has also been done on design of CM storage servers, e.g. as in [2, 10, 14], which mostly falls into several broad categories: 1) small scale servers, where in most cases all disks are connected to a single node; 2) medium scale LAN based servers, and (3) medium scale (either distributed or not) servers, which employ high speed interconnects, such as ATM based ....

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, 1994.

....media server. Due to the large size and bandwidth requirements of CM objects and CM servers large number of simultaneous users, a CM object is broken into fixed sized blocks which are distributed across all the disks. Several popular place ment techniques include round robin striping (e.g. [2]) RAID striping (e.g. 17] and hybrid (e.g. 8, 16] All these techniques can be categorized as constrained placement approaches where the location of a block is fixed and determined by the placement algorithm. However, an alternative placement approach is the randomized placement of blocks ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

....requests with the same amount of memory. By minimizing initial latency, the system can provide VCR functions with shorter response time, and thus, can improve the quality of service. We note that VCR functions like fast forward and fast rewind are considered new user requests in most VOD systems [2, 3, 7, 8]. Several bu er scheduling methods for VOD systems have been proposed that minimize memory requirements and initial latency [3, 4, 7, 9, 17] The bu er scheduling method determines the order of lling data bu ers allocated to user requests. These methods use static bu er allocation to allocate ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered striping in multimedia information systems. In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pages 79-90, 1994.

....0 100 200 300 400 500 600 Time [seconds] Consumption Rate [KB s] C R Fig. 2. Variable consumption rate of a 10 minute segment of a typical MPEG 4 movie. There are two basic techniques to assign the data blocks to the magnetic diskdrives that form the storage system: in a round robin sequence [2], or in a random manner [7] Traditionally, the round robin placement utilizes a cycle based approach to scheduling of resources to guarantee a continuous display, while the random placement utilizes a deadline driven approach. In general, the round robin cyclebased approach provides high ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

....to the client machine. In its simplest implementation, which is adopted in this study, the ALMADEM VoD server considers a contiguous layout of films in disk. In this layout, all blocks of a same film are stored contiguously on disk. More sophisticated layout schemes, involving striping techniques [1, 10], region based allocation [15] and randomized placement [19] have been discussed extensively in the literature but are not the focus of this work. The buffer structure is basically main memory space used to synchronize the disk and network threads. It is implemented as a circular buffer which ....

S. Berson, R.Muntz, S. Ghandeharizadeh, and X. Ju. Staggered striping in multimedia information systems. In ACM SIGMOD Conference, 1994. 11

....links and this contention varies based on the network load. Also, a network transfer requires multiple resources (links, input and output ports) unlike the assumption of requiring only one resource in these studies. Hence, these results cannot be directly applied to our problem. Recent work [2, 1, 3, 4, 8] has looked at disk scheduling in a video server. File systems for handling continuous media have been proposed [9, 10, 11, 12, 13] Multicomputer based video servers are studied in [14, 15, 16] Related work in multicomputer communication includes estimation of delays in the network [17, 18, 19] ....

....by a set fn k ; s k j 1) mod Ng in slot j F in the next frame. It is clear that if fn k ; s k j g is source and destination conflict free, fn k ; s k j 1) mod Ng is also source and destination conflict free. Variants of such data distributions have been proposed and analyzed [11, 8]. This simple approach makes movie distribution and scheduling stright forward. However, it does not address the communication scheduling problem. Also, it has the following drawbacks: i) not more than one movie can be started in any given slot. Since every movie stream has to start at storage ....

S. Berson, S. Ghandeharizadeh, and R. Muntz. Staggered striping in multimedia information systems. Proc. of SIGMOD, 1994.

....consecutive blocks are put on consecutive disks, cycling repeatedly over all of them. This simple and e ective strategy has the disadvantage that the layout is xed for any number of disks. A change of the array size results in an almost complete redistribution of blocks, which is not feasible. In [3], Berson et al. generalized the idea of disk striping. They proposed a staggered scheme in which consecutive blocks are separated by a certain stride (in disk striping this stride is 0) and compare it to clustered approaches [20] where the disks are partitioned into groups. They claim that their ....

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and Xiangyu Ju. Staggered striping in multimedia information systems. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pages 79-90, 1994. SIGMOD Record 23(2), June 1994.

....includes the ID of the last frame played in the previous mode. Serving Fast Forward and Fast Rewind without incurring more network and disk resources is a challenging task. 2. 4 File System The multimedia server uses a special file system, which is an extension of the file system proposed in [3]. The file system has the following desirable features: Soft real time guarantee . Simultaneous read and write capabilities . Fault tolerance . Support for variable block sizes . Online fragmentation management . Trick mode support . Data striping In the following sections we show how ....

S. Berson, S. Ghandeharizedeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the

....in Figure 1.3 for two copies. We use a similar problem, placing balls in runs, to explain this surprising result. Suppose that we sequentially place n balls into m urns by putting each ball into a randomly chosen urn. It has been shown by many studies (e.g. Azar et al. 1994; Barve et al. 1997; Berson et al. 1994; Papoulis, 1984) that there is a high probability the balls can be distributed among the urns quite unevenly. However, if for each ball we randomly select two locations and each ball is placed in the least full urn between these two possible locations, the number of balls can be spread out evenly ....

Berson, S., Ghandeharizadeh, S., Muntz, R., and Ju, X. (1994). Staggered striping in multimedia information systems. Proceedings of the ACM Sigmod, pages 79--89.

.... Modern magnetic disks play a very important role in multimedia computing, such as file cache in a hierarchical multimedia storage system[7, 10] and storage for multimedia clips[6] and (long) continuous media[4] The objectives of many research projects aim to allow a disk or a group of disks[1] to provide high bandwidth, as well as to respond as predictable as expected[12] For both goals, it requires an accurate performance model of disk as foundation to understand and to predict the behavior of the disk. In addition, the model cannot be too complicated to be implemented as on line ....

Steven Berson, Richard Muntz, Shahram Ghandeharizadeh, and Xiangyu Ju. Staggered striping in multimedia information systems. In Proc. ACM SIGMOD, 1994.

....and databases) that is novel. In fairness, Grosky s framework [12] can deal with integrating relational and pictorial information, though he does not address schema mismatches which have been addressed in our implementation of hybrid knowledge bases [21] 13.2 Berson, et al. Berson et al. [6] study how to distribute multimedia objects (bodies of data) across a network, given that the multimedia objects occupy large bandwidths, while traditional disks have relatively small bandwidths. Our framework is complementary to theirs in the following way: in the definition of our field framerep ....

....Our framework is complementary to theirs in the following way: in the definition of our field framerep in the type statenode (cf. Figure 1) framerep points to the physical location of the multimedia data. This data itself could be further broken up into chunks as suggested by Berson et al. [6]. This would facilitate effective bandwidth utilization of this data when communicating information across the network. 45 13.3 Gibbs et al. Gibbs et al. 10] study how stream based temporal multimedia data may be modeled using object based methods. Our work is related to theirs upto a point, ....

S. Berson, S. Ghandeharizadeh, R. Muntz and X. Ju. (1994) Staggered Striping in Multimedia Information Systems, Proc. 1994 ACM SIGMOD Conf. on Management of Data, pps 79--90. 49

....on the order of requests, free resources, and required bandwidth of each stream. Then, 20, 21] examine, using simulation, several policies for the replacement of data in the disk buffers, which are different from traditional buffer replacement policies due to timing constraints. Finally, [10] refines and improves the earlier work using striping. A related paper, 14] describes the problems and some solutions introduced by the conceptually simple fast forward replay, for browsing purposes. Modifying the rate of delivery affects architectures and policies designed under different ....

.... time for retrieval of replicated data [12] ffl optimizing allocation of objects in tertiary storage [13] ffl continuous retrieval of streams using parallelism [19] ffl replicas in parallel multimedia information systems [20] 9 ffl hierarchical storage structures [21] ffl staggered striping [10] ffl video server fast forward functionality [14] 5 New perspectives New applications, such as the multimedia data processing, and new hardware software technology are major factors to drive database research to new directions. A survey of the effects of up to date storage hardware technology ....

Berson, S. and Ghandeharizadeh, S., Staggered Striping in Multimedia Information Systems. Proceedings of the ACM SIGMOD'94 , Minneapolis, Minnesota, USA, May 1994, pp. 79--90.

....to support many simultaneous I O requests. A distributed, multi node design based on commodity personal computer hardware components provides a cost effective and scalable solution. To store a large media object X on such a platform it is commonly striped into n blocks: X 0 ; X 1 ; Xn 1 [14, 21, 7, 3, 12]. There are two basic techniques to assign these blocks to the magnetic disk drives that form the storage system: a) in a round robin sequence [15, 3] or (b) in a random manner [11, 4, 16] Traditionally, the round robin placement utilizes a cyclebased approach to scheduling of resources to ....

....and scalable solution. To store a large media object X on such a platform it is commonly striped into n blocks: X 0 ; X 1 ; Xn 1 [14, 21, 7, 3, 12] There are two basic techniques to assign these blocks to the magnetic disk drives that form the storage system: a) in a round robin sequence [15, 3], or (b) in a random manner [11, 4, 16] Traditionally, the round robin placement utilizes a cyclebased approach to scheduling of resources to guarantee a continuous display, while the random placement utilizes a deadline driven approach. We plan to implement the random block placement in ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 79--90, May 1994. 162

....(FF) Data in a frame is contiguously stored in a disk drive. This approach suffers from the following limitation. If the size of a frame is too small, the portion of wasteful work attributed to disk arm movements, i.e. seeks, becomes significant, resulting in a poor utilization of disk bandwidth [1, 9]. An alternative is to store and retrieve data at the granularity of a block, termed BB. A block consists of a number of frames and data in a block is contiguously stored on a disk platter. This approach is flexible because one can determine the size of a block and the number of frames it ....

....of data with MTP is a non trivial research topic with a number of open ended questions, such as When to trigger reorganization What objects to migrate Where to migrate these objects etc. 2. 3 Data Placement across Disk Drives Assuming a system with d homogeneous disks, the data is striped [1, 10, 16] across the disks in order to distribute the load of a display evenly across the disks. There are a number of ways to assign blocks of an object to the d disks. We consider two, namely, round robin and random. With round robin, blocks are assigned to disks in a round robin manner starting with an ....

[Article contains additional citation context not shown here]

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 79-89, 1994.

....playback stream is started, data is sequentially read from the storage system at the playout rate. This predictability is exploited in many video servers that carefully layout data on disk to achieve good load balance and high real time performance. The most widely used scheme is data stripping [1][4] 15] We on other hand, have proposed a random allocation of data to disks as a mean to support more general workloads [2] 12] Nevertheless, we have shown in [12] that even for predictable workloads like video playback, despite the randomness of data allocation, our system has performance ....

S. Berson, R. Muntz, S. Ghandeharizadeh, X. Ju "Staggered Striping in Multimedia Information Systems ", SIGMOD 94, p.79-90, May 1994.

....such that contention for the drives is avoided and real time guarantees can be made. There are a number of proposals for layout of video data on parallel disks. The most common method proposed is to stripe each object across the parallel disks using a fixed size stripe granule (i.e. disk block)[2][5] 8] 14] 22] 27] While allocation of a disk block on a disk is often random, logically consecutive blocks are typically allocated in strictly roundrobin order to disks. This approach can work well when the workload is highly predictable, uniform and has constant bit rate (CBR) However, in ....

....data allocation. Surprisingly, our results show that RIO is competitive and often outperforms traditional striping schemes, even for uniform sequential CBR stream workloads. 1. 2 Related Work Data striping has been proposed in many video servers, in which videos are striped over a set of disks [2][5] 8] 14] 22] 27] The advantage of striping over designs in which different objects are stored on different disks is that it decouples storage allocation from bandwidth allocation, avoiding potential load imbalances due to variations in object popularity. However, striping imposes two basic ....

S. Berson, R. Muntz, S. Ghandeharizadeh, and X. Ju. Staggered striping in multimedia information systems. In ACM SIGMOD 94, pages 79--90. ACM, 1994.

....(e.g. pre fetching) then the user might observe frequent disruptions and delays with video and random noises with audio. These artifacts are collectively termed hiccups. A number of studies have addressed hiccup free display of audio and video clips assuming a homogeneous disk subsystem [2]. In this paper, we investigate techniques that ensure continuous display of audio and video clips with heterogeneous disk drives. Figure 2 shows a taxonomy of the possible approaches. With the partitioning schemes, disks are grouped based on their model. To illustrate, assume a system that has ....

....this figure, a larger physical disk denotes a newer disk model that provides both a higher storage capacity and a higher performance 2 . The blocks of a movie G are assigned to the logical disks in a round robin manner to distribute the load of a display evenly across the available resources [26, 2, 21, 8]. A logical block is declustered [12] across the participating physical disks. Each piece is termed a fragment (e.g. G H H in Figure 3) The size of each fragment is determined such that the service time ( E 01KML CN 0 ) of all physical disks is identical. The disk service time is ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

....the search space for the best retrieval plan based on the defined metrics. The CM server, utilized by Prime, guarantees the uninterrupted display of the continuous media objects. There has been a number of studies describing the design and implementation of such servers, see [TPBG93, RV93, CL93, BGMJ94, GVK 95] We ignore the detail architecture of the CM server and conceptualize it as a server bandwidth, termed RCM . In this section, we start by describing the flexibilities and a formal definition for query script. After that, we consider the search space, the cost model, and the search ....

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

....Mitra is scalable because it can service a higher number of simultaneous displays as a function of additional disk bandwidth. The key technical idea that supports this functionality is to distribute the workload imposed by each display evenly across the available disks using staggered striping [BGMJ94] to avoid the formation of hot spots and bottleneck disks. Mitra is high performance because it implements techniques that maximize the number of displays supported by each disk. This is accomplished in two ways. First, Mitra minimizes both the number of seeks incurred when reading a block ....

....as a single disk drive. This discussion introduces EVEREST [GIZ96] Mitra s file system, and motivates a PM driven scheduling paradigm that provides feedback from a PM to the Scheduler to control the rate of data production. Subsequently, we discuss an implementation of the staggered striping [BGMJ94] technique. 3.1 One Disk Configuration To simplify the discussion and without loss of generality, conceptualize the d disks as a single disk with the aggregate transfer rate of d disks. When we state that a block is assigned to the disk, we imply that the block is declustered [GRAQ91, BGMJ94] ....

[Article contains additional citation context not shown here]

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R.R. Muntz and X. Ju, \Staggered Striping in Multimedia Information Systems," Proceedings of ACM SIGMOD '94, pp. 79-90, 1994.

No context found.

R. Muntz Berson, S. Ghandeharizadeh and X. Ju. Staggered striping in multimedia information systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 79 -- 90, May 1994.

No context found.

Steven Berson, Shahram Ghandeharizadeh, Richard R. Muntz, and Xiangyu Ju. Staggered striping in multimedia information systems. In ACM Int. Conf. on Management of Data (SIGMOD'94), pages 70--90, Minneapolis, MN, USA, May 1994.

No context found.

S. Berson. S. Ghandeharizadeh, R. Muntz, X. Ju, "Staggered striping in Multimedia Information Systems," Proc. of the fifth Intl. Conf. on Management of Data, May 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, X. Ju, "Staggered Striping in Multimedia Information Systems," Proceedings of the Fifth International Conference on Management of Data, Minneapolis, MN, May 1994, p. 79.

No context found.

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, 1994.

No context found.

Berson, S., Muntz, R., Ghandeharizadeh, S. and Ju, X. "Staggered Striping in Multimedia Information System", In Proceedings of the SIGMOD Conference, May 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. ACM SIGMOD Conference, pages 79--90, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R.R. Muntz and X. Ju. "Staggered Striping in Multimedia Information Systems" In SIGMOD'94, Minneapolis, Minnesota, pp. 79-90, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, pages 79--90 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered striping in multimedia information systems. In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pages 79-90, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. SIGMOD, 1994.

No context found.

S. Berson et al., "Staggered Striping in Multimedia Information Systems," Proc. 1994 ACM Sigmod Int'l Conf. Management of Data, ACM Press, NewYork, 1994, pp. 79-90.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

No context found.

S. Berson et al., "Staggered Striping in Multimedia Information Systems," Proc. 1994 ACM Sigmod Int'l Conf. Management of Data, ACM Press, NewYork, 1994, pp. 79-90.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered Striping in Multimedia Information Systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju, "Staggered Striping in Multimedia Information Systems," in ACM SIGMOD, pp. 79--90, (Minneapolis, MN), May 1994.

No context found.

Berson, S., R. Muntz, S. Ghandeharizadeh, and X. Ju, "Staggered Striping in Multimedia Information Systems," Proc. of SIGMOD'94, pp.1-12, 1994.

No context found.

S. Berson, S. Ghandeharizadeh, R. Muntz, X. Ju, "Staggered striping in multimedia information systems," ACM SIGMOD `94, pp. 79-90, 1994.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC