Adaptive information system design

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Adaptive information system design: one query at a time

Full text

Pdf (1.03 MB)

Source

International Conference on Management of Data archive
Proceedings of the 1985 ACM SIGMOD international conference on Management of data table of contents

Austin, Texas, United States

Pages: 280 - 290

Year of Publication: 1985

ISBN:0-89791-160-1

Also published in ...

Authors

C. T. Yu	Dept. of EECS, University of Illinois at Chicago
C. H. Chen	Bell Communication Research

Sponsor

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): , Downloads (12 Months): , Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/318898.318924 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.

	Aper	Apers, P M.G , "Redundant allocation Of relations In a communlcatlon network", Proc 5th Berkeley workshop on Distributed Data Management and Computer Networks, Feb 1981, pp 245-258
	Aper1	Peter M. G. Apers, Data allocation in distributed database systems, ACM Transactions on Database Systems (TODS), v.13 n.3, p.263-304, Sept. 1988 [doi>10.1145/44498.45063]
	Bato	D. S. Batory, Optimal file designs and reorganization points, ACM Transactions on Database Systems (TODS), v.7 n.1, p.60-81, March 1982 [doi>10.1145/319682.319696]
	Case	Casey R G , "Allocation of copies of a file in an information network", AFIP Conference Proceeding, Vol 40, 1972, Spring Joint Computer Conference, May 1972, pp 612-625
	Chan	Chan A Y "Index selection in a Self-Adaptive Relatlmal Data Base Management System", M SC thesis, Dept of EECS, M I T 1976
	ChLi	Chang, S K and Llu, A C , "a database file allocation problem", IEEE COMPASC. 1981
	Chen	Chai-Hsiung Chen, An adaptive technique and its application in database design, 1984
	Chri	Stavros Christodoulakis, Estimating block transfers and join sizes, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	Cook	Stephen A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, p.151-158, May 03-05, 1971, Shaker Heights, Ohio, United States [doi>10.1145/800157.805047]
	Crof	Croft, W B , "Clustering large files of documents using the single link method", JASIS, 1977, pp 341-344
	DOFO	Lawrence W. Dowdy , Derrell V. Foster, Comparative Models of the File Assignment Problem, ACM Computing Surveys (CSUR), v.14 n.2, p.287-313, June 1982 [doi>10.1145/356876.356883]
	Eswa	Eswaran, K P , "Placement of records in a file and file allocation In a computer network", IFIP, Aug 197'1, PP 304-307
	FiHo	Marshall L. Fisher , Dorit S. Hochbaum, Database Location in Computer Networks, Journal of the ACM (JACM), v.27 n.4, p.718-735, Oct. 1980 [doi>10.1145/322217.322226]
	FUNG	K. T. Fung, A reorganization model based on the database entropy concept., The Computer Journal, v.27 n.1, p.67-71, Feb. 1984 [doi>10.1093/comjnl/27.1.67]
	Ghos	Ghosh, S P , "Dlstrl buting a data base with logical assocatlons on a computer network for parallel searching", IBM Research Report, lY74
	GrBe	Enrique Grapa , Geneva G. Belford, Some theorems to aid in solving the file allocation problem, Communications of the ACM, v.20 n.11, p.878-882, Nov. 1977 [doi>10.1145/359863.359895]
	HaNi	Michael Hammer , Bahram Niamir, A heuristic approach to attribute partitioning, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582110]
	HaCh	Michael Hammer , Arvola Chan, Index selection in a self-adaptive data base management system, Proceedings of the 1976 ACM SIGMOD international conference on Management of data, June 02-04, 1976, Washington, D.C.
	HeYa	Hevner A and Yao B "Query Processing in distributed database systems", IEEE Transact1 ons on Software Engineering, 1979, PP 117-187
	HoSa	Ellis Horowitz , Sartaj Sahni, Fundamentals of Computer Alori, W. H. Freeman & Co., New York, NY, 1978
	Jako	Jakobsson, M , "Reducing block accesses In inverted files for partial clustering", Informat ion Systems, 1980, pp. I-5
	Karp	Karp, R ttReduclbillty among combinational problems", In Canplexlty of Computer Computations, K Miller and J Thather Ed , Plenum Press, N Y 1472, pp 85-104
	Knut	Knuth, D., "Sorting and Searcnlng" , VOl 3, Addison Wesley, 1973
	LaYu	K. Lam , C. T. Yu, A clustered search algorithm incorporating arbitrary term dependencies, ACM Transactions on Database Systems (TODS), v.7 n.3, p.500-508, Sept. 1982 [doi>10.1145/319732.319756]
	LiYa	JH Llou and S B Yao "Multi- Dlmenslonal Clustering for Data Bass Orgaruzatlon" Informatlon Systems, vol 2 pp 187-198 (1977)
	LoPo	Loomis, M S and Popek, G J , "A model for database distrioutlon" , Trends and Applications, Computer E"ethods, - IFEE Computer boclety, 1976
	MaRi	Samy Mahmoud , J. S. Riordon, Optimal allocation of resources in distributed information networks, ACM Transactions on Database Systems (TODS), v.1 n.1, p.66-78, March 1976 [doi>10.1145/320434.320449]
	Mase	Salvatore T. March , Dennis G. Serverance, The determination of efficient record segmentations and blocking factors for shared data files, ACM Transactions on Database Systems (TODS), v.2 n.3, p.279-296, Sept. 1977 [doi>10.1145/320557.320574]
	OmSc	E Omiecinskl and P Scheuermann "A Global Approach to Record Clustering and File Reorganization", Technical Report, Dept of EECS, Northwestern Unlv , (Dee 1%3)
	Salt	Gerard Salton, Dynamic information and library processing, Prentice-Hall, Inc., Upper Saddle River, NJ, 1975
	Schk	A clustering algorithm for hierarchical structures, ACM Transactions on Database Systems (TODS), v.2 n.1, p.27-44, March 1977 [doi>10.1145/320521.320531]
	Shne	Ben Shneiderman, Optimum data base reorganization points, Communications of the ACM, v.16 n.6, p.362-365, June 1973 [doi>10.1145/362248.362267]
	SoDi	Philip A. Bernstein , Nathan Goodman , Eugene Wong , Christopher L. Reeve , James B. Rothnie, Jr., Query processing in a system for distributed databases (SDD-1), ACM Transactions on Database Systems (TODS), v.6 n.4, p.602-625, Dec. 1981 [doi>10.1145/319628.319650]
	Tuel	William G. Tuel, Jr., Optimum reorganization points for linearly growing files, ACM Transactions on Database Systems (TODS), v.3 n.1, p.32-40, March 1978 [doi>10.1145/320241.320244]
	Van	C. J. Van Rijsbergen, Information Retrieval, Butterworth-Heinemann, Newton, MA, 1979
	Van	Van RlJsbergen, C J , "Further experiments WI th hierarchical clustering in document retrieval", Informatlon Storage and Retrieval, 1974, pp l-14
	UrOl	Urano, Y , Ono, K and Inone, S , "Optimal design of distributed networks", Proc of International Conference on Computer Canmunlcatlon, Aup 1974, PP 413- 420
	Wah	Wah, B W , "An efflclent heurlstlc for file placement on distributed database", IEEE COMPSAC 1980, pp 462-468
	Yao	S. B. Yao , K. S. Das , T. J. Teorey, A dynamic database reorganization algorithm, ACM Transactions on Database Systems (TODS), v.1 n.2, p.159-174, June 1976 [doi>10.1145/320455.320467]
	YCTB	Yu, C T Chant: C Templeton, M and Brill D "On the design of processing a distributed query processing algorithm", ACI: SIGMOD, 1963, PP 30-34