找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Information Systems; COINS IV Julius T. Tou Book 1974 Plenum Press, New York 1974 data model.data structure.information processing.informat

[复制链接]
楼主: 不足木
发表于 2025-3-23 10:50:42 | 显示全部楼层
An Analysis of Document Retrieval Systems Using a Generalized Model,es, strong points, and inadequacies. The generalized model represents a flexible, comprehensive, modular structure of a retrieval system, as opposed to previous models, which generally emphasize only a specific aspect of the retrieval problem.
发表于 2025-3-23 16:00:16 | 显示全部楼层
发表于 2025-3-23 21:34:01 | 显示全部楼层
Processing Systems Optimization through Automatic Design and Reorganization of Program Modules, as to produce an optimal design with respect to a specific target machine. Performance criteria for the optimal design is defined in terms of four components: (1) processing time, (2) transport volume, (3) core size, and (4) number and type of I/O units required.
发表于 2025-3-24 00:01:16 | 显示全部楼层
Verification and Semantic Checking of APL Programs,rification of programs with arrays. (2) The partial operators introduce the complication of showing program executability. The latter reason leads to a new form of programming, called “semantic checking.”
发表于 2025-3-24 05:17:06 | 显示全部楼层
发表于 2025-3-24 08:43:26 | 显示全部楼层
发表于 2025-3-24 14:25:57 | 显示全部楼层
https://doi.org/10.1007/978-1-4684-2694-6data model; data structure; information processing; information retrieval; information system; learning; m
发表于 2025-3-24 17:11:08 | 显示全部楼层
发表于 2025-3-24 22:43:44 | 显示全部楼层
A Relational Data Management System,RDMS is a flexible data analysis and manipulation system based on Codd’s relational operations and Child’s set-theoretic operations. This presentation focuses on the application of these techniques to practical problems. Some details of our implementation on a large virtual memory computer will be given.
发表于 2025-3-25 00:20:24 | 显示全部楼层
A Data Base Search Problem,The problem of constructing an efficient retrieval algorithm for responding to queries of arbitrary complexity on a relational data base is considered. A query, represented by a relation-defining expression in the relational calculus, is translated into a retrieval algorithm.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 03:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表