TL;DR: In this article, a line identification information is provided to verify that the line of text identified in the symbol information is the same line contained in the source file, and the hash value and line length corresponding to the line text is compared to a line length and hash value computed for the text retrieved from the source files.
Abstract: Each database component file contains information regarding the text contained in the source file which enables the user to quickly determine the frequency of occurrence of the specified text and the location of the specified text in the source file. For each textual word (referred to herein as a "symbol") an entry in the database file is provided containing symbol information. The symbol information comprises the symbol name, symbol type and line number in the source file where the symbol is located. Line indentification information is also provided which contains the line numbers in the source file and corresponding line lengths and hash values which are computed from the contents of the lines of the text in the source file. Before a line of text identified in a query is displayed to the user indicating a result of the query, the line identification information provides the means to verify that the line of text identified in the symbol information is the same line of text contained in the source file. The hash value and line length corresponding to the line text is compared to a line length and hash value computed for the text retrieved from the source file. If the computed line length and hash value does not match the line length and hash value contained in the line identification information, the text does not match the database reference because the source file has been changed subsequent to the generation of the database. Thus, the problems that arise because the source file version does not match the version of the database component file is prevented.
TL;DR: In this paper, a database system for text files is employed which comprises a compiler which receives as input a description of the source file types or languages and search filter and outputs a tag set definition file and filter file to be used by the browsing mechanism.
Abstract: A database system for text files is employed which comprises a compiler which receives as input a description of the source file types or languages and search filter and outputs a tag set definition file and filter file to be used by the browsing mechanism. The tags set definition file is input to the database builder mechanism and is used by the database builder to select and translate the information from the input source file to a database component file. Thus, by providing a description of the source file type, any type of source file in any language can be input to the database system of the present invention to generate a database component file which may be subsequently reviewed and searched by the same browsing mechanism.
TL;DR: The concept of viewpathing is introduced followed by a description of the second component of the 3‐D file system, transparent viewPathing, and the implementation and future directions are described.
Abstract: This paper describes the two primary components of what we refer to as the 3-D file system. The first component is version files, which allows multiple versions of a single file to coexist. The concept of viewpathing is introduced followed by a description of the second component of the 3-D file system, transparent viewpathing. Finally, we describe our implementation and future directions.
TL;DR: A computer memory interpretation file, or structures file, enables automatic location and interpretation of memory resident components of operating system programs, user programs, data buffers, and the like as discussed by the authors.
Abstract: A computer memory interpretation file, or structures file, enables automatic location and interpretation of memory resident components of operating system programs, user programs, data buffers, and the like. The structures file contains sufficient information pertaining to each control structure to allow a program using it to identify and locate each iteration of any component that may be memory resident. The structures file relieves the program of requiring reference definitions pertaining to the control structures or their sub-components and eliminates the requirement for programming logic normally necessary to recognize and perform specialized operations determined by the nature of the control structure being processed.
TL;DR: When I use a word,' Humpty Dumpty said in a rather scornful tone, 'it means just what I choose it to mean-neither more nor less .'.
Abstract: When I use a word,' Humpty Dumpty said in a rather scornful tone, 'it means just what I choose it to mean-neither more nor less .'-Lewis Carroll