Showing papers on "Inverted index published in 1998"

Content-based query of image databases, inspirations from text retrieval: inverted files, frequency-based weights and relevance feedback

Abstract: In this paper we report the application of techniques inspired by text retrieval research to the content-based query of image databases. In particular, we show how the use of an inverted file data structure permits the use of a feature space of $\mathcal{O}(104)$ dimensions, by restricting search to the subspace spanned by the features present in the query. A suitably sparse set of colour and texture features is proposed. A scheme based on the frequency of occurrence of features in both individual images and in the whole collection provides a means of weighting possibly incommensurate features in a compatible manner, and naturally extends to incorporate relevance feedback queries. The use of relevance feedback is shown consistently to improve system performance, as measured by precision and recall.

Method for mapping an index of a database into an array of files

Abstract: A method for mapping a plurality of index entries in an index of a database includes parsing one or more records into elements, allocating each of the elements to one of a plurality of element groupings, and storing a representation of each of the elements in an index in conjunction with representations of other of the elements within its element grouping.

Efficient and effective distributed information management

Abstract: A method stores, indexes, searches and retrieves data information in a large data storage and retrieval system. Large amounts of data information, subject to searching and retrieval, are broken down and stored in sub-collections. Each sub-collection separately performs indexing of only the data information contained within that sub-collection and forms an inverted index. Statistical information derived from the inverted index of each sub-collection is collected by a global collection custodian and compiled into a global index. The global index is then passed to each sub-collection and is used by each during searching and retrieving of data information. Search results from each sub-collection are passed to the global collection custodian and organized there before being passed to a system user.

Layered index structures in document database systems

Abstract: Note: ACM Press, p. 406-413 Reference LSIR-CONF-2000-026 Record created on 2005-09-15, modified on 2017-05-12

Method and apparatus for browsing and storing data in a distributed data processing system

Abstract: A method and system for browsing a distributed database. Storage is allocated in a computer for a file, wherein the file is used for storing references to data in the distributed database for retrieval at a later time. A reference to data in the distributed database is added to the file in response to a user input from a user using the computer to browse the distributed database. The data is retrieved from the distributed database using references to the data stored within the file in response to a selected event.

Efficient implementations of constructs such as feature tables

Abstract: A methodology for producing efficient implementations of constructs such as feature tables is disclosed. The method of superimposed coding and the method of inverted list tables are combined. Although they both accomplish similar things, each method has advantages over the other under particular circumstances. The method of superimposed coding is used where feature table rows are “dense” or contain many records of interest, while the method of inverted list tables is used where feature table rows are “sparse” or contain few records of interest. The combination of the two methods results in a synergistic method that loses no accuracy and is generally faster in operation than what could be achieved by the application of either method alone.

Data base management method and device therefor and network management method and device therefor

Abstract: PROBLEM TO BE SOLVED: To update a network management program just by updating the correspondence table of an object key and an object identifier used in the network management program. SOLUTION: Whether or not a file for which the allocation of an index is outputted is already present, is searched first (S103), and in the case that an output file is present, the output file is read (S105) and data in the output file and the data under consideration in a data base are compared (S106). As the result of comparison, the index of the pertinent data of the output file is allocated as the index of the data under consideration (S108) in the case that the data under consideration are present in the output file, a new index is allocated to the data under consideration (S109) in the case that the data under consideration are not present in the output file and the index of the desired data of the output file is allocated as the index of the data under consideration (S110) in the case that the name of the data under consideration is changed. In such a manner, the same index is continuously attached to the continuously present data. COPYRIGHT: (C)1999,JPO

Developing text retrieval system using robust morphological parsing

Abstract: The paper describes the way in which a text retrieval system for inflected languages, such as Croatian, can be improved. Based on a robust morphological analysis, it can search for all word forms without using a dictionary. Using all the possible combinations of morphological alternation and filtering final results through words in inverted index, a satisfactory level of precision can be obtained.

Integrating Structured Data and Text

Abstract: Essential problems associated with searching and retrieving relevant documents were discussed in the preceding chapters. However, simply searching massive quantities of unstructured data is not sufficient.

Structured Modeling for Video Databases

Abstract: Video information is an important component of multimedia systems such as Digital Library, World-Wide Web (WWW), and Video-On-Demand (VOD) service system. However, since it is difficult to store and retrieve video data like traditional text data, new data models suitable for video information are required. Video information has hierarchical document structure inherently, so it is named “structured video document” in this paper. This paper proposes a data model, a query language, and indexing scheme for structured video documents in order to store, retrieve, and share video documents efficiently in collaborative work environment. In representing structured video documents, the object-oriented data modeling technique is used since the hierarchical structure information can be modeled as complex objects. We also define object types for the structure information. Our query language supports not only content-based retrieval but also structure-based retrieval, which means the queries based on the structure of video documents. In order to perform structure queries efficiently, as well as to reduce the storage overhead of indices, an optimized inverted index structure is proposed.