SavedAdd your journal

Journals / Istanbul University Journal of Electrical and Electronics Engineering / 2002 / Cilt: 2 - Sayı: 1

Kısmi-eşleme erişimi için uygun dosya yapılarının analizi

Analysis of efficient file structures for partial-match retrieval

Oğuzhan ÖZTAŞ
Pages
447–451
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

We discussed here each method in general perspective and tried to obtain the best result of them by comparing these technics eachother on a simple data model.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, the patial-match retrieval was examined.
📊
Key Findings & Data:This access method is an access method to needed for different purposes.
💡
Conclusion & Impact:We discussed here each method in general perspective and tried to obtain the best result of them by comparing these technics eachother on a simple data model.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, the patial-match retrieval was examined. This access method is an access method to needed for different purposes. It is mostly used for office automation. There are different methods for these access type. We discussed here each method in general perspective and tried to obtain the best result of them by comparing these technics eachother on a simple data model.

Özet

Yapılan çalışmada, Kısmi-Eşleme Erişimi incelenmiştir. Bu erişim yöntemi çeşitli amaçlar için ihtiyaç duyulan bir erişim yöntemidir. Özellikle ofis otomasyonunda çok kullanılır. Bu erişim üzerine çeşitli yöntemler vardır. Biz burada bu yapılardan her birini genel hatlarıyla anlatıp, bu teknikleri genel ve basit bir yapı üzerinde birbiri ile mukayese ederek aralarında en iyi sonuç vereni saptamaya çalıştık.

🔖

Cite This Article

ÖZTAŞ, O. (2022). Kısmi-eşleme erişimi için uygun dosya yapılarının analizi. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 2 - Sayı: 1, 447–451. https://ajindex.com/articles/543951

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

  1. C. Faloutsos, March 1985, “Access methods for text”, ACM Comput. Surveys, Vol. 17, No. 1, pp. 49-74 2. C.J.Date, 1990, “Database Systems”, Addison-Wesley Pub.Comp., Vo l. 1 3. J.Llyod and K.Ramamohanarao, 1982, “Partial Match Retriavel For Dynamic Files”, BIT, Vol. 22, pp. 150-168. 4. J.Pfaltz, W.Berman and E.Cagley, September 1980, “Partial-Match Retrieval Using Indexed Descriptor Files”, Commun. ACM, Vol. 23, No. 9, pp. 522-528. 5. K.Ramamohanarao, John W.Lloyd and James A. Thom, December 1983, “Partial- Match Retrieval Using Hashing and Descriptors”, ACM Transactions on Database Systems, Vol. 8, No. 4, pp. 552-576. 6. Philip J. Pratt, Joseph J. Adamski, 1987, “Database Systems Management and Design”, Boyd & Fraser Publishing Com. 7. R.Fagin, J.Nievergelt, N.Pippenger and R.Strong, September 1979, “Extendible Hashing – A Fast Access Method for Dynamic Files”, ACM Transactions on Database Systems, Vol. 4, No. 3, pp. 315-344.