Name
Abstract | ||
|---|---|---|
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinations of criteria. In [6], Fagin gives an algorithm for efficiently merging multiple ordered streams of ranked results, to form a new stream ordered by a combination of those ranks. In this paper, we describe the implementation of Fagin's algorithm in an actual multimedia middleware system, including a novel, incremental version of the algorithm that supports dynamic exploration of data. We show that the algorithm would perform well as part of a single multimedia server, and can even be effective in the distributed environment (for a limited set of queries), but that the assumptions it makes about random access limit its applicability dramatically. Our experience provides a better understanding of an important algorithm, and exposes an open problem for distributed multimedia information systems. |
Year | Venue | Keywords |
|---|---|---|
1999 | Conference on Cooperative Information Systems | random access,better understanding,single multimedia server,multimedia information system,different data source,ranked results,multimedia middleware,different modality,important algorithm,middleware system,actual multimedia,dynamic exploration,reactive power,databases,information retrieval,merging,distributed environment,information system,data access,middleware |
Field | DocType | ISBN |
Middleware,Open problem,Distributed Computing Environment,Ranking,Computer science,Algorithm,Multimedia servers,Merge (version control),Multimedia information systems,Multimedia,Random access,Distributed computing | Conference | 0-7695-0384-5 |
Citations | PageRank | References |
26 | 9.14 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edward L. Wimmers | 1 | 1177 | 430.27 |
| Laura M. Haas | 2 | 3872 | 1128.30 |
| Mary Tork Roth | 3 | 564 | 111.93 |
| Christoph Braendli | 4 | 26 | 9.14 |