-
公开(公告)号：US06678705B1
公开(公告)日：2004-01-13
申请号：US09441284
申请日：1999-11-16
IPC分类号： G06F1730
CPC分类号： G06F17/30011 , G06Q10/10 , Y10S707/99955
摘要： The present invention discloses an architecture for document archival built on network-centric groupware such as Internet standards-based messaging. Archiving and retrieving and classifying documents into meaningful collections is accomplished in a manner similar to sending email to recipients, retrieving messages from folders, and classifying messages into folder hierarchies. In the simplest scenario, if saveme.com is the archiving server's name, then sending an email to abc@saveme.com will cause the contents of the email message to be archived in the abc mailbox. The archived documents may be automatically stored in jukeboxes of non-tamperable media such as Write Once Read Multiple (WORM) Compact Disks (CD), which provide high storage capacity, low cost compared to magnetic disks, random data access, and long-term stability. The present invention leverages existing messaging infrastructures, and the resulting environment is not intrusive, easier to administer, and easier to deploy than conventional dedicated document archival systems.
摘要翻译： 本发明公开了一种基于网络为中心的组件的文档归档架构，例如基于互联网标准的消息传递。 将文档归档和检索和分类为有意义的集合是以类似于向收件人发送电子邮件，从文件夹检索邮件以及将邮件分类到文件夹层次结构的方式完成的。 在最简单的情况下，如果saveme.com是归档服务器的名称，那么发送电子邮件至abc@saveme.com将导致电子邮件的内容存档在abc邮箱中。 存档的文档可能会自动存储在非易失性介质的光盘机中，例如一次写入多读（WORM）小型磁盘（CD），其提供高存储容量，与磁盘相比成本低，随机数据访问和长期 稳定性。 本发明利用现有的消息传递基础设施，并且所产生的环境不如传统的专用文档档案系统那样是侵入性的，更容易管理的并且容易部署。
-
公开(公告)号：US6154746A
公开(公告)日：2000-11-28
申请号：US63780
申请日：1998-04-22
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943
摘要： A method for transforming multi-dimensional data points into 1-dimensional values which are stored in a 1-dimensional index structure is disclosed. The data space is divided into a first plurality of pyramids each having a center point of the data space as a top and a (d-1) dimensional surface of the data space as a base, wherein the first plurality of pyramids is equal to twice the number of dimensions of the data space. Each pyramid is then divided into a second plurality of partitions. A Pyramid-value for each partition is then computed. Finally, each partition is stored in the index structure using the Pyramid-value as an index key.
摘要翻译： 公开了一种用于将多维数据点变换为1维索引结构中存储的1维值的方法。 数据空间被划分为第一多个金字塔，每个具有作为数据空间的顶部和（d-1）维表面的数据空间的中心点作为基础，其中第一多个金字塔等于两次 数据空间的维数。 然后将每个金字塔分成第二多个分区。 然后计算每个分区的金字塔值。 最后，使用Pyramid-value作为索引关键字将每个分区存储在索引结构中。
-
搜索结果
2 条记录 (耗时 0.014 秒)
