Veri tabanına dayalı müşteri takip sistemi ve uygulaması

Abstract

ÖZET Günümüz Türkiye 'sinde bilgisayarlar hızla yayılmaktadır. Böyle bir ortamda orta ve küçük isletmelerde de bilgisayar kullanılmaya başlanmıştır. Bu çalışma orta boy bir pazarlama isletmesi için hazırlanmıştır. Bu çalışmada veri ve bilgiden, veri tabanından, veri tabanı yönetim sistemlerinden teorik olarak bahsedilmiştir. Tez 'in son bölümünde uygulama ele alınmıştır. Uygulamadaki program yapısal bir program olan Quick BASIC version 4.5 ile hazırlanmıştır. Bu program veri tabanı yaklaşımı ile kurulmuştur. 5fani veriler rast gele örgütlenmemiştir. Program dosyaları Random olarak açılmıştır. Program kayıtları sıralarken (sort) Shell sıralama tekniği kullanılmıştır. Dosyalara erişimde de indeksli erişim metodu kullanılmıştır îndeksli erişim için üç ayrı anahtar kullanılmıştır. Bu anahtar verilerin indeks listeleri biribirine link edilmiştir. Ayrıca indeks dosyasının özet indeksi oluşturularak çoklu taramalar için ikinci indeks dosyası kullanılmaktadır.Burada seçilen anahtarlar satış tarihi, müşterinin kodu, müşterinin adı ve soyadının ilk harflerinin toplamı 'dır. Taksitlerini ödeyen müşterinin kaydı anahtar veri alanları sıfırlanarak silinir. Ana dosya her değişiklikte yeniden oluşturulmamış olunur. Veri dosyası büyüyen dosya olduğu için, kayıt yaparken anahtarları sıfır olan kayıtların üzerine kayıt yapılır. Ayrıca programdan ayrılırken data dosyalarının birer adette yedekleri oluşturulur. IX

SUMMARY This thesis is designed for database of PC and application. Now, we will mention data structure and database and then application. Computers prosessin formation. The information is represented by data values help temporarily within the program's data area or recorded permanently on a file. Often there are relationships between different data values which the program needs to use. For example, when processing sales orders, the relationship may be to link the quantity of an item ordered with the corresponding quantity in stock. Another relationship may be to sequence the sales orders according to the required delivery date. Here, each sales order is related to the next in sequence. To enable programs to make use of these relationships, the data values must be organized to allow access to related items of data. The organized collection of data is called a data structure. If the data is held on a file, we speak of the file structure, while for more elaborate file structures the therm database can be employed. The operation allowed on the data structure must be defined to specify how programs may access andprocess the data in the structure. We can use the * equation* DATA STRUCTURE = ORGANIZED DATA + OPERATIONS to express this fact. The data structure have to reflect the required relationship between the data items and are designed for a specific application. Nevertheless there are some standart data structures which are often used in their own right and can form the basis of other special purpose structures. In order to keep implementation details of the way when discussing data structures, we shall look at abstract views before, mentioning concrete implementations. This appproach should also be adopted when you design data structures for an application. For each data structure, several points may be cconsidered : - Its abstract structure that is a picture of the data fields and their relationships, without considering exactly how they may be implemented in a programming language or as a physical file. The concrete structures which might be used to implement it. - The methods used to process structure for example, adding or deleting values, listing all the data items or finding a specific item. XI- How the algorithms may be coded. - Typical applications for the structure. For a specific problem you need to consider the possible data structures which could be used and the processing reqirements of the application in order to design the most appropriate structure for it. Data structure are used to permit efficient storage of related data items and provided efficient access to that data. Often, simple structures will provide storage for and access to a collection of data items, but not efficiently enough. More complex data structures and more complex methods of processing are used to increase efficiency. In some cases the need is to reduce storage space and in other to increase processing speed. Databases have devoloped as organizations have attempt to make fuller use of the information held on their computers. Technological advances have resulted in development staff salaries becoming a major part of software development butgets. A properly designed database management system can dramaticly improve development staff productivity. Originally, application programs would have their own file set. A logical file development of this was the integrated file system where one file can be accessed by several programs. For example, accounting XIIsystems are normally integrated file systems, where the files ( or legers ) can be accessed by several different programs. Such integrated file systems tend to reflect an organisation. s departmental structure, there being accounts system, stock control systems, etc. Often the questions management require to be answered before they can be succesfully run the business need the assessment of information from several departmental areas. By collecting all organizational data within one file and using sophisticated access methods, a database is created. Such a system shoul allow managers to access to information they require. Often the word ^database' is used to refer to any large collection of data. Specialised database texts tend to have stricter definitions. A database must be organized so that it can serve the data requirements of different applications. The term relates to the physically stored data and software required to enable users to access the data. The database management system provides this interface between the users and a physical data. It is the users of the system who dictate the form of the database. If database is to robust ( that is, if it dose not have to be redesigned each time a new application is add ), an attempt has to be made to find some naturel relationships between those data items which is hold. To XIIIachieve the physical implementation of such relationships it may be necassary to use complex data structures. As third generation language, we have used Quick BASIC. This program was done for marketing company. This company sell their goods with instalment. Company manager 's problem is chase of customer 's debt. The program was prepared with database approach, and was used index lists. Sort technique is Shell sort. Thus this program quickly rank datas. In this program have got three key. The first key is customer, second is purchase date and third is first character of name and surname. So you can search a customer with customer number or name and surname. And with purchase date key, you can prepare collection lists. These keys' lists was linked together. Thus sort time is shorter then other positions. When you delet the record, all fields don ' t delete. Only key fields do zero. Because, data file enlarge every time. Thus program don 't do unnecassary operation. And when program is finished, data file is copyed as a backup file. As a result of data security is provided. XIV