article

Free access

The Datacycle architecture

Authors:

A. WeinribAuthors Info & Claims

Communications of the ACM, Volume 35, Issue 12

Pages 71 - 81

https://doi.org/10.1145/138859.138868

Published: 01 December 1992 Publication History

PDF eReader

References

[1]

Belkin, NJ~. and Croft, W,B. Information filtering 'and information retrieval: Two sides of the same coin. Commun. ACM 3.5, 12 (Dec. 1992).]]

Digital Library

Google Scholar

[2]

Bowen, T.F., Gopal, G. Herman, G.E. and Mansfield, WH. A scalable database architecture for network services. In Proceedings of the Eighth International Switching Symposiun, (Stockholm, Sweden, May 1990).]]

Crossref

Google Scholar

[3]

Codd, E.F. A relational model for large shared data banks. Commun. ACM 14, 6 (June 1970), 377-387.]]

Digital Library

Google Scholar

[4]

Date, C.J. An introduction to Database Systems. Vol 1, Fourth Ed. Addison- Wesley, Reading, Mass., 1986.]]

Digital Library

Google Scholar

[5]

Eswaran K.P., Gray, J.N., Lorie, R.A. and Traiger, I.L. The notions of consistency and predicate locks in a database system. Commun. ACM 19, 11 (Nov. 1976), 624-633.]]

Digital Library

Google Scholar

[6]

Gawlick, D. Processing hot spots in high performance systems. In the Proceedings of Spring COMPCON '85. IEEE Computer Society, Los Alamires, Calif., 1985.]]

Google Scholar

[7]

Gold, I. and Boral, H. The power of the private workspace model. Inf. Syst. 11, 1 (1986), 1- 7,]]

Digital Library

Google Scholar

[8]

Goldberg, D., Nichols, D., Oki, B. and Terry, D. Using collaborative filtering to weave an information tapestry. Commun. ACM 35, 12 (Dec. 1992).]]

Digital Library

Google Scholar

[9]

Herman, G. and Gopal, G. The case for orderly sharing. In Lecture Notes in Computer Science on High Performance Transaction Systems, D. Gawlick, M. Haynie, and A. Reuter, Eds. Springer-Verlag, New York, 1987.]]

Digital Library

Google Scholar

[10]

Herman, G.E., Gopal, G., Lee, K.C. and Weinrib, A. The Datacycle architecture for very high throughput database systems. In Proceedings of ACM SIGM OD (San Francisco). ACM, New York, 1987.]]

Digital Library

Google Scholar

[11]

Hsiao, D.K. Advances in Database Machine Architectures. Prentice-Hall, Englewood Cliffs, NJ., 1983.]]

Digital Library

Google Scholar

[12]

Kung, H.T. aud Robinson, J.T, On optimistic methods tbr concurrency control. ACM Trans. Database Syst. 6, 2 (June 1981), 213-226.]]

Digital Library

Google Scholar

[13]

Lee, K.C. and Herman, G.E. A high performance VLSI data tilter. In Database Machines and Knowledge Base Machines. Kluwer Academic Publishers, Boston, 1988, pp. 251-268.]]

Crossref

Google Scholar

[14]

Lee, K.C., Hickey, T.M., Mak, V.W. and Herman, G.E. VLSI accelerators for large database systems. IEEE Micro mag. (Dec. 1991).]]

Digital Library

Google Scholar

[15]

Lee, K.C. and Mak, V.W. Design and analysis of a parallel VLSI stringsearch algorithm. In Proceedings of the Sbcth International Workshop, IWDM '89 (DeauvilJe, France, June). 1989, pp. 215-222.]]

Digital Library

Google Scholar

[16]

Leilich, H.-O., Stiege, G. and Zeidler, H.C. A search processor for data base management systems. In Proceedings of the Fourth Conference on Very Large Databases (West Berlin, June 1978), pp. 280-287.]]

Google Scholar

[17]

Loeb, S. Dedicated filters for casual users: Architecting personalized delivery of multimedia information. Commun. ACM 35, 12 (Dec. 1992).]]

Digital Library

Google Scholar

[18]

Mak. V.W., Lee, K.C. and Frieder, O. Exploiting parallelism in pattern matching: An information retrieval applicatiom ACM Trans. Inf. Syst. (1991).]]

Digital Library

Google Scholar

[19]

Mansfield, W.H. and Fleischman, R.M. A high performance ad-hoc fuzzy query processing system for relational databases. North American Fuzzy Information Processing Society Workshop (1992).]]

Google Scholar

[20]

Matoba, T., Lee, K.C., Herman, G.E. and Manstield, W.H. A rapid turnaround design of a high speed VLSI search processor. Integr,: The VLSI J. 10 (1991), 319-337.]]

Digital Library

Google Scholar

[21]

Oracle RDBMS Database Administrator's Guide Version. 6.0. 1990, pp. 18-19.]]

Google Scholar

[22]

St. Ama nd, J. A common file approach to data processing. In Proceedings of Trends and Applications: 1978 Distributed Processing (Gaithersburg, Md., May 1978), pp. 78-83.]]

Google Scholar

[23]

Stonebraker, M. Triggers and inference in data base systems. In Proceedings of the Islamorada Conference on Expert Data Bases (Islamorada Fla., Feb. 1985).]]

Digital Library

Google Scholar

[24]

Transputer Databook. INMOS Corp., 1989.]]

Google Scholar

[25]

Volliollah, T. A.conceptual framework for fuzzy query processing-A step toward very intelligent database systems. Inf. Process. Manage. 13 (1977), 289-303.]]

Crossref

Google Scholar

[26]

Weikum, G. Enhancing concurrency in layered systems. In Lecture Notes in Computer Science on High Peroformance Transactions Systems, d. Gawlick, M. Haynie and A. Reuter, Eds. Springer- Verlag, New York, 1987.]]

Digital Library

Google Scholar

[27]

Zadeh, L.A. Fuzzy sets. Inf. contr. 8 (1965), 338-353.]]

Google Scholar

Cited By

View all

Singh P(2020)A Broadcasting Scheme for Transaction Processing in a Wireless EnvironmentHandling Priority Inversion in Time-Constrained Distributed Databases10.4018/978-1-7998-2491-6.ch005(86-102)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-2491-6.ch005
Barbadekar APatil P(2020)A Novel Method of Smart Communication using PSoC for Wireless Push System2020 International Conference on Emerging Smart Computing and Informatics (ESCI)10.1109/ESCI48226.2020.9167681(184-187)Online publication date: Mar-2020
https://doi.org/10.1109/ESCI48226.2020.9167681
Kazda AKolmogorov VRolínek M(2018)Even Delta-Matroids and the Complexity of Planar Boolean CSPsACM Transactions on Algorithms10.1145/323064915:2(1-33)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3230649
Show More Cited By

Index Terms

The Datacycle architecture
1. Information systems
  1. Data management systems
    1. Database design and models
    2. Database management system engines
  2. Information retrieval
    1. Information retrieval query processing

Recommendations

A Proposal of Transaction Processing Method for MongoDB

At present, to deal with a large amount of variety data in the database, various NoSQL databases have been proposed and put to practical use. However, since most of them support the transaction processing only on the single data, there is the problem ...
Database Concurrency Control in Multilevel Secure Database Management Systems

Concurrent execution of transactions in database management systems (DBMSs) may lead to contention for access to data, which in a multilevel secure DBMS (MLS/DBMS) may lead to insecurity. Security issues involved in database concurrency control for MLS/...
Multi-dimensional partitioning for massively parallel database machines
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing

Harder, new requirements are appearing in the area of database systems. The popularity reached by parallel database systems during the past decade, due to their high performance and scalability

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 35, Issue 12

Special issue on information filtering

Dec. 1992

85 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/138859

Editor:
Jacques Cohen

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1992

Published in CACM Volume 35, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

143
Total Citations
View Citations
1,082
Total Downloads

Downloads (Last 12 months)179
Downloads (Last 6 weeks)14

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Singh P(2020)A Broadcasting Scheme for Transaction Processing in a Wireless EnvironmentHandling Priority Inversion in Time-Constrained Distributed Databases10.4018/978-1-7998-2491-6.ch005(86-102)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-2491-6.ch005
Barbadekar APatil P(2020)A Novel Method of Smart Communication using PSoC for Wireless Push System2020 International Conference on Emerging Smart Computing and Informatics (ESCI)10.1109/ESCI48226.2020.9167681(184-187)Online publication date: Mar-2020
https://doi.org/10.1109/ESCI48226.2020.9167681
Kazda AKolmogorov VRolínek M(2018)Even Delta-Matroids and the Complexity of Planar Boolean CSPsACM Transactions on Algorithms10.1145/323064915:2(1-33)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3230649
Cabello S(2018)Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar GraphsACM Transactions on Algorithms10.1145/321882115:2(1-38)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3218821
Gao JImpagliazzo RKolokolova AWilliams R(2018)Completeness for First-order Properties on Sparse Structures with Algorithmic ApplicationsACM Transactions on Algorithms10.1145/319627515:2(1-35)Online publication date: 18-Dec-2018
https://dl.acm.org/doi/10.1145/3196275
Adjiashvili D(2018)Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded CostsACM Transactions on Algorithms10.1145/318239515:2(1-26)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3182395
Adjiashvili DBaggio AZenklusen R(2018)Firefighting on Trees Beyond Integrality GapsACM Transactions on Algorithms10.1145/317304615:2(1-33)Online publication date: 7-Dec-2018
https://dl.acm.org/doi/10.1145/3173046
Waghmare VThool R(2014)Structured Signature Scheme for Efficient Dissemination of Tree Structured DataProceedings of the 2014 International Conference on Computational Intelligence and Communication Networks10.1109/CICN.2014.186(882-889)Online publication date: 14-Nov-2014
https://dl.acm.org/doi/10.1109/CICN.2014.186
Črepinšek MLiu SMernik M(2013)Exploration and exploitation in evolutionary algorithmsACM Computing Surveys10.1145/2480741.248075245:3(1-33)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480752
Dionisio JIII WGilbert R(2013)3D Virtual worlds and the metaverseACM Computing Surveys10.1145/2480741.248075145:3(1-38)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480751
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

A Proposal of Transaction Processing Method for MongoDB

Database Concurrency Control in Multilevel Secure Database Management Systems

Multi-dimensional partitioning for massively parallel database machines

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations