• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.230-232
• /
• 2013

For Many enterprises are creating and handling huge amount of data in their business administration. However, it would be impossible for general databases such as Relational Databases, hierarchical databases, and network databases to manage and analyze this large amount of document data efficiently and effectively. So, in this paper, we define document databases and check out their characteristics such as consistency and transaction. And we propose appropriate or inappropriate subjects for application of document databases.

• The Journal of Korean Association of Computer Education
• /
• v.4 no.2
• /
• pp.85-95
• /
• 2001

Since documents on the Web are naturally partitioned into many document databases, the efficient information retrieval process requires identifying the document databases that are most likely to provide relevant documents to the query and then querying the identified document databases. We propose a neural net based user feedback learning mechanism for such an efficient information retrieval. Presented learning mechanism learns about underlying document databases using the relevance feedbacks obtained from user's retrieval experiences. For a given query, the learning mechanism, which is sufficiently trained, discovers the document databases associated with the relevant documents and retrieves those documents effectively.

• Journal of Korean Library and Information Science Society
• /
• v.24
• /
• pp.45-79
• /
• 1996

Rising publication costs and declining financial resources have resulted in renewed interest among librarians in resource sharing. Although the idea of sharing resources is not new, there is a sense of urgency not seen in the past. Driven by rising publication costs and static and often shrinking budgets, librarians are embracing resource sharing as an idea whose time may finally have come. Resource sharing in electronic environments is creating a shift in the concept of the library as a warehouse of print-based collection to the idea of the library as the point of access to need information. Much of the library's material will be delivered in electronic form, or printed. In this new paradigm libraries can not be expected to su n.0, pport research from their own collections. These changes, along with improved communications, computerization of administrative functions, fax and digital delivery of articles, advancement of data storage technologies, are improving the procedures and means for delivering needed information to library users. In short, for resource sharing to be truly effective and efficient, however, automation and data communication are essential. The possibility of using full-text online databases as a su n.0, pplement to interlibrary loan for document delivery is examined. At this point, this article presents possibility of using full-text online databases as a means to interlibrary loan for document delivery. The findings of the study can be summarized as follows : First, turn-around time and the cost of getting a hard copy of a journal article from online full-text databases was comparable to the other document delivery services. Second, the use of full-text online databases should be considered as a method for promoting interlibrary loan services, as it is more cost-effective and labour saving. Third, for full-text databases to work as a document delivery system the databases must contain as many periodicals as possible and be loaded on as many systems as possible. Forth, to contain many scholarly research journals on full-text databases, we need guidelines to cover electronic document delivery, electronic reserves. Fifth, to be a full full-text database, more advanced information technologies are really needed.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.107-115
• /
• 2022

Recently, big data applications need another database different from the Relation database. NoSQL databases are used to save and handle massive amounts of data. NoSQL databases have many advantages over traditional databases like flexibility, efficiently processing data, scalability, and dynamic schemas. Most of the current applications are based on the web, and the size of data is in increasing. NoSQL databases are expected to be used on a more and large scale in the future. However, NoSQL suffers from many security issues, and one of them is access control. Many recent applications need Fine-Grained Access control (FGAC). The integration of the NoSQL databases with FGAC will increase their usability in various fields. It will offer customized data protection levels and enhance security in NoSQL databases. There are different NoSQL database models, and a document-based database is one type of them. In this research, we choose the CouchDB NoSQL document database and develop an access control mechanism that works at a fain-grained level. The proposed mechanism uses role-based access control of CouchDB and restricts read access to work at the document level. The experiment shows that our mechanism effectively works at the document level in CouchDB with good execution time.

• The Journal of Information Technology and Database
• /
• v.1 no.1
• /
• pp.31-62
• /
• 1994

Information systems for application areas like office automation, customer service or computer aided manufacturing are usually highly interactive and deal with complex document structures composed of multiple media formats. For the realization of these systems, nonstandard database systems, which we call document databases, need to handle different types of coarse-and fine-grained document objects(like full-text documents, graphics and images), hierarchical and non-hierarchical relationships between objects(like composition-links and cross-references using hypertext structures) and document attributes of different types such as formatting/presentation information and access control. In this paper, we present the underlying data model for document databases based on descriptive markup languages that provide mechanisms for specifying the logical structure(or schema) of individual documents stored in the database. We then describe extensions to the data model for supporting notion of composite structures("join" operators for documents) --composition and hyperlinking mechanisms for representing compound documents and inter-linked documents as unique entites separate from their components. Furthermore, due to the interactive nature of the application domains, the database system in conjunction with clients(or browsers) has to support visual navigation and graphical query mechanisms. We describe the functionality of a new user interface paradigm called HyBrow for meeting the above mentioned requirements. The underlying implementation strategy is also discussed.discussed.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.6
• /
• pp.113-121
• /
• 2005

Since documents on the Web are naturally partitioned into many document databases, the efficient information retrieval (IR) process requires identifying the document databases that are most likely to provide relevant documents to the query and then querying the identified document databases. We first introduce a neural net agent for such an efficient IR, and then propose the hierarchically organized multi-agent IR system in order to scale our agent with the large number of document databases. In this system, the hierarchical organization of neural net agents reduced the total training cost at an acceptable level without degrading the IR effectiveness in terms of precision and recall. In the experiment, we introduce two neural net IR systems based on single agent approach and multi-agent approach respectively, and evaluate the performance of those systems by comparing their experimental results to those of the conventional statistical systems.

• Journal of the Korean Society for Library and Information Science
• /
• v.17
• /
• pp.49-83
• /
• 1989

A Full text retrieval system is a natural language document retrieval system in which the full text of all documents in a collection is stored on a computer so that every word in every sentence of every document can be located by the machine. This kind of IR System is recently becoming rapidly available online in the field of legal, newspaper, journal and reference book indexing. Increased research interest has been in this field. In this paper, research on full text databases and retrieval systems are reviewed, directions for research in this field are speculated, questions in the field that need answering are considered, and variables affecting online full text retrieval and various role that variables play in a research study are described. Two obvious research questions in full text retrieval have been how full text retrieval performs and how to improve the retrieval performance of full text databases. Research to improve the retrieval performance has been incorporated with ranking or weighting algorithms based on word occurrences, combined menu-driven and query-driven systems, and improvement of computer architectures and record structure for databases. Recent increase in the number of full text databases with various sizes, forms and subject matters, and recent development in computer architecture artificial intelligence, and videodisc technology promise new direction of its research and scholarly growth. Studies on the interrelationship between every elements of the full text retrieval situation and the relationship between each elements and retrieval performance may give a professional view in theory and practice of full text retrieval.

• Journal of the Korean Society for Library and Information Science
• /
• v.30 no.2
• /
• pp.51-86
• /
• 1996

The primary purpose of this study is to verify the difference of behavioural characteristics between the subject specialists and professional searchers in searching full-text databases. The major findings and conclusions from this study are summarized as follows. Analyses of Search questions(the degree of understanding with search questions, the degree of difficulty in selecting terms, and the degree of expectation of search results), search processes(the number of search terms used, the number of Boolean operators and qualifiers used, the number of documents browsed and the search time(the connecting time, time to spend per one output document, time to spend per one relevant output document) and search results(the searching efficiency(the number of relevant documents, the ,recall ratio and the precision ratio), the search cost(the total search cost. the search cost per one output document and the search cost per one relevant output document) and the degree of satisfaction with search results) are significantly different between the subject specialists and professional searchers in searching full-text databases.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2007.02a
• /
• pp.163-167
• /
• 2007

We propose an XML document storage system, called XDMS (XML Document Management System), by using an object-relational DBMS. XDMS generates object database schema from XML Schema and stores the XML documents in an object-relational database. SAX parser is used for understanding the structure of the XML documents, and XDMS transforms the documents into objects in the database. Experiment shows that object-relational databases provide more efficient storage and query model compared with relational databases.

• Journal of Information Management
• /
• v.30 no.3
• /
• pp.44-54
• /
• 1999

A description of SGML(Standard Generalized Markup Language) is given together with a detailed description of WIPO Standard ST.32. The benefits of the use of SGML are highlighted-its system Independence and flexibility in building publication systems and full-text databases. A structure of WIPO Standard ST,32 based patent content is defined by DTD(document type definition) written in ST.32, and full-text itself is described with generalized markup depending on DTD. This article explains how to represent a document structure : a hierarchy structure like a entire document, a specific, sub-document, a paragraph, or non-hirarchy structure like a table drawings, or chemical structures. Merits of SGML In patent document processing are also discussed.