TRMeister is a DBMS with high-performance full-text search functions. With TRMeister, high-speed full-text search, including high-precision ranking search in addition to Boolean search, is possible. Further, in addition to search, high-speed insert and delete are possible, allowing full-text search to be used in the same way as other types of database search in which data can be searched right after data is inserted. This makes it easy to combine normal attribute search with full-text search and thus easily create text search applications.

No abstract available.

Article Free Access Share on The use of phrases from query texts in information retrieval (poster session) Authors: Masumi Narita Software Research Center, Ricoh Co., Ltd., 1-1-17 Koishikawa, Bunkyo-ku, Tokyo, Japan Software Research Center, Ricoh Co., Ltd., 1-1-17 Koishikawa, Bunkyo-ku, Tokyo, JapanView Profile , Yasushi Ogawa Software Research Center, Ricoh Co., Ltd., 1-1-17 Koishikawa, Bunkyo-ku, Tokyo, Japan Software Research Center, Ricoh Co., Ltd., 1-1-17 Koishikawa, Bunkyo-ku, Tokyo, JapanView Profile Authors Info & Claims SIGIR '00: Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrievalJuly 2000 Pages 318–320https://doi.org/10.1145/345508.345621Online:01 July 2000Publication History 11citation18DownloadsMetricsTotal Citations11Total Downloads18Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Although n-gram (n successive characters) indexing is widely used in retrieval systems for documents in Japanese and other Asian languages, it is difficult to process ranking retrieval efficiently using n-gram indexing. This is because frequency information for query words needs to be computed using indexed data since this information is not directly available from the n-gram index. To reduce processing costs, this paper proposes a pseudo-frequency method, which uses a word's estimated frequencies instead of precise ones. The results of experiments on NTCIR, a Japanese IR test collection, showed that the proposed method speeded up retrieval without degrading retrieval effectiveness.

No abstract available.

A character based indexing is preferable for Japanese IR systems since Japanese words are not segmented.This paper proposes a new character indexing method to enhance our previous method which divided character pair index entries into disjoint groups based on character classes.Since frequency data is used to determine hashed entries for character pairs and to establish a special string index, both search speed and precision are improved.Moreovel<, bit strings are managed using small and large blocks, so registration and retrieval are accelerated.Experiments using patent abstracts showed these proposals are quite effective.

This paper describes a new indexing method for Japanese text databases using the simple keyword string, in which a compound word is treated as a string of simple words, which are the smallest units in Japanese grammar which still maintain their meanings. This method allows retrieved texts to be ranked, according to the similarity of their meaning to the query, without using a control vocabulary or thesaurus. This paper also introduces the keyword feature, which describes the syntactic and semantic characteristics of a word, and results in more precise keyword extraction and text retrieval as well as simple dictionary maintenance.

Timing-and constraint-oriented placement procedures are

Placement algorithms optimizing signal delay as well as wirability for high-speed ECL masterslice LSI's are proposed. Equivalent constraints of wire length for clock skew, data path delay, and wired-OR are classified according to upper and lower limits. To maintain such limits, a top-down method utilizing an augmented two-dimensional clustering placement with “scope” and “zone”, which are new concepts representing limits, and an iterative weighted improvement method are presented. Such algorithms are applied to hundreds of 2 K and 5 K gate ECL masterslice LST's for a newly developed high-end mainframe computer, the Hitachi M-680H. Through such algorithms, the physical design is greatly improved by guaranteeing high wirability and improving electrical characteristics.