ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Scheduling issues in multimedia query optimization
Full text PdfPdf (229 KB)
Source ACM Computing Surveys (CSUR) archive
Volume 27 ,  Issue 4  (December 1995) table of contents
Pages: 590 - 592  
Year of Publication: 1995
ISSN:0360-0300
Authors
Minos N. Garofalakis  Univ. of Wisconsin, Madison
Yannis E. Ioannidis  Univ. of Wisconsin, Madison
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 29,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/234782.234797
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
CHAUDHURI, S. 1994. On optimization of multimedia queries. In Proceedings of the First Internattonal Workshop on Mult~medm Database Management Systems (San Francisco, CA), 1-5.
 
2
GARE~, M. R. AND G~UAM, R. L. 1975. Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4, 2 (June), 187-200.
 
3
GAROFALAKIS, N. AND IOANNIDIS, Y. E. 1995 Multi-dimensional resource scheduling for parallel queries. (Submitted for publication).
 
4
GRAHA~I, R.L. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Comput. 17, 2 (March), 416-429.

CITED BY  4
Ashish Goel , Monika R. Henzinger , Serge Plotkin , Eva Tardos, Scheduling data transfers in a network and the set scheduling problem, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.189-197, May 01-04, 1999, Atlanta, Georgia, United States
Chandra Chekuri , Sanjeev Khanna, On multi-dimensional packing problems, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.185-194, January 17-19, 1999, Baltimore, Maryland, United States
Ashish Goel , Monika R. Henzinger , Serge Plotkin , Eva Tardos, Scheduling data transfers in a network and the set scheduling problem, Journal of Algorithms, v.48 n.2, p.314-332, September 2003
Vittorio Bilò , Michele Flammini , Luca Moscardelli, Pareto approximations for the bicriteria scheduling problem, Journal of Parallel and Distributed Computing, v.66 n.3, p.393-402, March 2006

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Query formulation


General Terms:
Management, Theory

Collaborative Colleagues:
Minos N. Garofalakis: colleagues
Yannis E. Ioannidis: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player