Introduction

Introduction The VLDB Journal (1998) 7: 205 The VLDB Journal c Springer-Verlag 1998 This issue is devoted to papers that address various aspects lar, it considers multi-clip queries whose results are multiple of multimedia data management. The database community clips. Starting from the assumption that, in general, it does has, perhaps unnecessarily narrowly, focused mostly on sim- not matter in which order these clips are returned to the ilarity matching and related indexing techniques, and on the user, the paper considers various optimization techniques design of continuous media servers. There is much more for processing these types of queries. to multimedia data management and the papers in this is- “Integrating Symbolic Images into a Multimedia sue demonstrate the richness of this application domain as a Database System Using Classificatin and Abstraction Ap- source of database problems. proaches” by A. Soffer and H. Samet, consider methods of The six papers that appear in this issue were selected querying symbolic image databases. These databases consist from among the thirty-three that were submitted in response of images that are composed of a finite set of symbols that to our call for papers. The submission rate was far higher have semantic meaning. The paper compares two approaches than we had expected, also suggesting the significant activity for supporting queries on these databases: classification ap- in this field. The acceptance rate of about 15% is highly proach and abstraction approach. The main focus of the pa- selective and guarantees a very high quality special issue. per are methods of integrating these two into a multimedia There is a second group of papers now undergoing revision database management system. and further review that we hope will appear in future issues P. Zezula, P. Savino, G. Amato and F. Rabitti’s paper of the VLDB Journal. “Approximate Similarity Retrieval with M-Trees” considers The first paper in this issue, “On periodic resource approximation techniques for the well-known problem of scheduling for continuous media databases” by M.N. Garo- similarity search. The work is conducted within the context falakis, B. Ozden, and A. Silberschatz addresses the im- of a metric tree index called the M-tree. The paper studies portant issue of scalability of continuous media servers by three approximation techniques that trade query precision for proper resource allocation. The paper provides a compre- improved performance. hensive study of the resource-scheduling problems within The final paper in this issue, “Delivering Presentations the context of enhanced pay-per-view (EPPV) model and from Multimedia Servers” by N.H. Balkir and G. Ozsoyoglu, develops an optimization formulation of resource allocation considers quite a different problem: that of optimizing the which is NP-hard. The paper proposes heuristics for solving delivery of full presentations from media servers rather than the problem in polynomial time. the delivery of independent audio/video streams. The paper The second paper by H. Jiang and A.K. Elmagarmid, examines presentations in three different domains and pro- entitled “Spatial and Temporal Content-based Access to Hy- vides buffer management and admission control algorithms pervideo Databases” focuses on video databases. It develops for these domains. a model for capturing video content in terms of multiple lev- We were almost victims of our own success. Handling els of abstractions and for representing the semantic associ- the review process for 33 papers in a 2-month period was a ations between them. The model is also capable of capturing logistical challenge and required us to call on many friends the video entities that users are interested in, called hot enti- and colleagues for favors. The names of 99 reviewers are im- ties, and of representing the relationships among them. The possible to list individually, but they all deserve our heartfelt paper discusses the processing of video queries using this thanks for the excellent job they have done. model. Enjoy this special issue!... The third paper, “Optimal Clip Ordering for Multi-clip Queries” by R.T. Ng and P. Shum, also deals with video databases, but focuses on the querying aspects. In particu- M. Tamer Ozsu and Stavros Christodoulakis http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals
Free
1 page

Loading next page...
1 Page
 
/lp/springer_journal/introduction-Bq4G0dEgWk
Publisher
Springer-Verlag
Copyright
Copyright © 1998 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s007780050064
Publisher site
See Article on Publisher Site

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial