198,240 research outputs found

    The relationship between IR and multimedia databases

    Get PDF
    Modern extensible database systems support multimedia data through ADTs. However, because of the problems with multimedia query formulation, this support is not sufficient.\ud \ud Multimedia querying requires an iterative search process involving many different representations of the objects in the database. The support that is needed is very similar to the processes in information retrieval.\ud \ud Based on this observation, we develop the miRRor architecture for multimedia query processing. We design a layered framework based on information retrieval techniques, to provide a usable query interface to the multimedia database.\ud \ud First, we introduce a concept layer to enable reasoning over low-level concepts in the database.\ud \ud Second, we add an evidential reasoning layer as an intermediate between the user and the concept layer.\ud \ud Third, we add the functionality to process the users' relevance feedback.\ud \ud We then adapt the inference network model from text retrieval to an evidential reasoning model for multimedia query processing.\ud \ud We conclude with an outline for implementation of miRRor on top of the Monet extensible database system

    EMAS

    Get PDF
    The purpose of this thesis is to design a database for videotex from the view point of a Graphic Designer without ignoring technological aspects. I am dealing with a problem that has been overlooked and needs to be addressed the problem of database structure, search procedure, and retrieval of information for videotex. The goal is to design a database for videotex that will give the user ease of manipulation of information and better retrieval of that information with high interactivity and massive random access

    Database search vs. information retrieval : a novel method for studying natural language querying of semi-structured data

    Get PDF
    The traditional approach of querying a relational database is via a formal language, namely SQL. Recent developments in the design of natural language interfaces to databases show promising results for querying either with keywords or with full natural language queries and thus render relational databases more accessible to non-tech savvy users. Such enhanced relational databases basically use a search paradigm which is commonly used in the field of information retrieval. However, the way systems are evaluated in the database and the information retrieval communities often differs due to a lack of common benchmarks. In this paper, we provide an adapted benchmark data set that is based on a test collection originally used to evaluate information retrieval systems. The data set contains 45 information needs developed on the Internet Movie Database (IMDb), including corresponding relevance assessments. By mapping this benchmark data set to a relational database schema, we enable a novel way of directly comparing database search techniques with information retrieval. To demonstrate the feasibility of our approach, we present an experimental evaluation that compares SODA, a keyword-enabled relational database system, against the Terrier information retrieval system and thus lays the foundation for a future discussion of evaluating database systems that support natural language interfaces

    Extended Combinatorial Constructions for Peer-to-peer User-Private Information Retrieval

    Get PDF
    We consider user-private information retrieval (UPIR), an interesting alternative to private information retrieval (PIR) introduced by Domingo-Ferrer et al. In UPIR, the database knows which records have been retrieved, but does not know the identity of the query issuer. The goal of UPIR is to disguise user profiles from the database. Domingo-Ferrer et al.\ focus on using a peer-to-peer community to construct a UPIR scheme, which we term P2P UPIR. In this paper, we establish a strengthened model for P2P UPIR and clarify the privacy goals of such schemes using standard terminology from the field of privacy research. In particular, we argue that any solution providing privacy against the database should attempt to minimize any corresponding loss of privacy against other users. We give an analysis of existing schemes, including a new attack by the database. Finally, we introduce and analyze two new protocols. Whereas previous work focuses on a special type of combinatorial design known as a configuration, our protocols make use of more general designs. This allows for flexibility in protocol set-up, allowing for a choice between having a dynamic scheme (in which users are permitted to enter and leave the system), or providing increased privacy against other users.Comment: Updated version, which reflects reviewer comments and includes expanded explanations throughout. Paper is accepted for publication by Advances in Mathematics of Communication

    SIMILARITY METRICS APPLIED TO GRAPH BASED DESIGN MODEL AUTHORING

    Get PDF
    Model reuse is typically facilitated by search and retrieval tools, matching the sought model with models in a database. This research aims at providing similar assistance to users authoring design exemplars, a data structure to represent parametric and geometric design problems. The design exemplar represents design problems in the form of a bi-partite graph consisting of entities and relations. Authoring design exemplars for relatively complex design problems can be time consuming and error prone. This forms the motivation of developing a search and retrieval tool, capable of retrieving exemplars that are similar to the exemplar that a user is trying to author, from a database of previously authored exemplars. In order to develop such a tool, similarity measures have been developed to evaluate the similarity between the exemplar that a user is trying to author and target exemplars in the database. Two exemplars can be considered similar based on the number and types of entities and relations shared by them. However, exemplars meant for the same purpose can be authored using different entities and relations. Hence, the two main challenges in developing a search and retrieval tool are to evaluate the similarity between exemplars based on structure and semantics. In this research, four distinct similarity metrics are developed to evaluate the structural similarity between exemplars for exemplar retrieval: entity similarity, relation similarity, attribute similarity, and graph matching similarity. As well, a thorough understanding of semantics in engineering design has been developed. Different types of semantic information found in engineering design have been identified and classified. Design intent and rationale have been proposed as the two main types of semantic information necessary to evaluate the semantic similarity between exemplars. The semantic and structural similarity measures have been implemented as separate modules in an interactive modeling environment. Several experiments have been conducted in order to evaluate the accuracy and effectiveness of the proposed similarity measures. It is found that for most queries, the semantic retrieval module retrieves exemplars that are not retrieved by structural retrieval module and vice versa

    A Database Interface for Complex Objects

    Get PDF
    We describe a formal design for a logical query language using psi-terms as data structures to interact effectively and efficiently with a relational database. The structure of psi-terms provides an adequate representation for so-called complex objects. They generalize conventional terms used in logic programming: they are typed attributed structures, ordered thanks to a subtype ordering. Unification of psi-terms is an effective means for integrating multiple inheritance and partial information into a deduction process. We define a compact database representation for psi-terms, representing part of the subtyping relation in the database as well. We describe a retrieval algorithm based on an abstract interpretation of the psi-term unification process and prove its formal correctness. This algorithm is efficient in that it incrementally retrieves only additional facts that are actually needed by a query, and never retrieves the same fact twice

    Implementing a Database Information System for an Electronic Baseball Scorecard

    Get PDF
    We present our design and implementation of a database system of information storage and retrieval for an electronic baseball scorecard. The program uses the relational MySQL database to hold information and a Tcl API to handle interactions between the database and the user interface code. This paper discusses the inner workings of how information storage was broken down inside the database, how queries were internally constructed in accordance with the user\u27s input, and how statistics for players and teams were calculated and returned to the user. Finally, we discuss some limitations attached to our current implementation of the program and propose improvements that can be made in future versions

    A Convolutional Neural Network-based Patent Image Retrieval Method for Design Ideation

    Full text link
    The patent database is often used in searches of inspirational stimuli for innovative design opportunities because of its large size, extensive variety and rich design information in patent documents. However, most patent mining research only focuses on textual information and ignores visual information. Herein, we propose a convolutional neural network (CNN)-based patent image retrieval method. The core of this approach is a novel neural network architecture named Dual-VGG that is aimed to accomplish two tasks: visual material type prediction and international patent classification (IPC) class label prediction. In turn, the trained neural network provides the deep features in the image embedding vectors that can be utilized for patent image retrieval and visual mapping. The accuracy of both training tasks and patent image embedding space are evaluated to show the performance of our model. This approach is also illustrated in a case study of robot arm design retrieval. Compared to traditional keyword-based searching and Google image searching, the proposed method discovers more useful visual information for engineering design.Comment: 11 pages, 11 figure

    Basic model for information retrieval based on free-text in database application

    Get PDF
    The purpose of this article is to design the basic model for information retrieval based on free-text domain in a particular database environment. It is an alternative method to the usage of key that is widely used in today database applications. At the end of this paper, we show the prototype that has been developed to support the freetext model verification. The result from the testing process is also given
    corecore