A searching method based on problem description and algorithmic features

  • Authors:
  • Yutaka Watanobe;Rentaro Yoshioka;Nikolay N. Mirenkov

  • Affiliations:
  • University of Aizu, Aizu-Wakamatsu, Japan;University of Aizu, Aizu-Wakamatsu, Japan;University of Aizu, Aizu-Wakamatsu, Japan

  • Venue:
  • DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A searching method related to “what” and “how” problem descriptions within a special software component library is presented. The “what” problem description is based on a high level representation of general features of initial and final data the problem can operate and produce. The “how” problem description is based on another high level representation of computational features of algorithm used for the problem solution. To realize the searching method, a special library in which each item is stored as a cyberFilm is considered. CyberFilm formats are used for representing data/knowledge units as self-explanatory components, and a special double ID is assigned to each component. The double ID is a pair of a URL-like address and a classification code. A cyberFilm represents a software component as a set of algorithmic features that provide a high-level and yet precise description of computation as well as semantics of problem that should be solved by the corresponding algorithm. These features are the basis of the classification code and the searching method. In this paper, a basic idea of the “what” problem description for the searching method, and an overview of the features for the “how” problem description, are considered. A possible library structure that uses the classification codes to support various searching goals is also described.