会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHOD OF PERFORMING A SLIDING WINDOW SEARCH
    • 执行滑动窗口搜索的方法
    • WO0007085A3
    • 2000-05-18
    • PCT/US9917240
    • 1999-07-29
    • NEO CORE LLCBRANDIN CHRISTOPHER LOCKTONMOORE ROBERT LEWIS
    • BRANDIN CHRISTOPHER LOCKTONMOORE ROBERT LEWIS
    • G06F17/30G06F7/02
    • G06F17/30985Y10S707/961Y10S707/99936
    • A method of performing a sliding window search includes the steps of : creating an associative database of a plurality of data strings (42), receiving a first window of a data block (44), iconizing the first window of the data block to form a first icon (46), determining if the first icon has a match in the associative database (48), determining a first byte icon of a first byte of data in the first window (50), executing an icon shift function to form a shifted first byte icon, (52) exclusive ORing the shifted first byte icon with the first icon to form a seed icon (54), determining a second icon for a second window using the seed icon and transforming a new byte of data onto the seed icon (56), and determining if the second icon has a match in the associative database (58).
    • 执行滑动窗口搜索的方法包括以下步骤:创建多个数据串(42)的关联数据库,接收数据块(44)的第一窗口,图标化数据块的第一窗口以形成 第一图标(46),确定第一图标在关联数据库(48)中是否具有匹配,确定第一窗口(50)中的第一数据字节的第一字节图标,执行图标移位功能以形成移位 第一字节图标,(52)将移位的第一字节图标与第一图标进行异或以形成种子图标(54),使用种子图标确定第二窗口的第二图标并将新数据字节变换到种子图标 (56),并且确定所述第二图标在所述关联数据库(58)中是否具有匹配。
    • 3. 发明申请
    • METHOD AND APPARATUS FOR STRUCTURING, MAINTAINING, AND USING FAMILIES OF DATA
    • 用于结构化,维护和使用数据库的方法和装置
    • WO02025471A2
    • 2002-03-28
    • PCT/US2001/029837
    • 2001-09-20
    • G06F17/24G06F17/30G06F17/00
    • G06F17/245G06F17/243G06F17/30294G06F17/30533G06F17/3061Y10S707/956Y10S707/961Y10S707/99942
    • The invention describes a method and apparatus for structuring, maintaining, and using families of data. According to the invention, given one or more sets of partitioning data, one may construct a set of families based on the values of fields and attributes of the records in a database system. The families are stored and managed in separate tables. The records in data tables are identified as belonging to one or more families. Furthermore, families may be represented in a hierarchical structure. Families may also inherit from each other based on a parent to child relationship also stored in the database. The invention provides means for fast and organized retrieval of sets data from a database. These and other features greatly facilitate automatic and consistent document generation.
    • 本发明描述了一种用于构造,维护和使用数据系列的方法和装置。 根据本发明,给定一组或多组分割数据,可以基于数据库系统中记录的字段和属性的值来构建一组家族。 系列在不同的表中进行存储和管理。 数据表中的记录被标识为属于一个或多个家族。 此外,家庭可以以分级结构表示。 家庭也可以根据父对子进行彼此继承,也存储在数据库中。 本发明提供了用于从数据库快速和有组织地检索集合数据的装置。 这些和其他功能大大方便了自动和一致的文档生成。
    • 5. 发明申请
    • A NOVEL DATABASE
    • 一个新的数据库
    • WO2008041242A2
    • 2008-04-10
    • PCT/IN2007/000426
    • 2007-09-21
    • BRAINWAVE APPLICATIONS LIMITEDSUREKA, Prateek
    • SUREKA, Prateek
    • G06F7/06
    • G06F17/30587Y10S707/961
    • The present invention provides a non-relational transactional and analytical database. It has a novel data architecture that allows data to persist without requiring any schema definition. The database of the present invention also provides a file system with in-built versioning, reliability and security and can be deployed in a distributed environment. The approach adopted in the present invention is to break down data into its fundamental atomic components, called memes, and use a special type of graph (utilizing non-standard vertices and edges) to create logical relationships, represented by links, between these components. The database operational functionality is deployed through an application program interface (API) using the query language that is based on recursive triplets of the form (subject, verb, object). The memes and links are identified with Universally Unique Identifiers (UUIDs). The database of the present invention also provides file system manipulation functionality through the use of UUIDs. The database of the present invention also provides a built-in security mechanism with meme level resolution.
    • 本发明提供了非关系事务和分析数据库。 它具有一种新颖的数据架构,允许数据持久化,而不需要任何模式定义。 本发明的数据库还提供具有内置版本,可靠性和安全性的文件系统,并且可以部署在分布式环境中。 本发明采用的方法是将数据分解为其基本原子分量(称为模型),并使用特殊类型的图(利用非标准顶点和边)来创建由这些组件之间的链接表示的逻辑关系。 通过应用程序接口(API)部署数据库操作功能,该应用程序接口(API)使用基于形式(主语,动词,对象)的递归三元组的查询语言。 模块和链接用通用唯一标识符(UUID)标识。 本发明的数据库还通过使用UUID来提供文件系统操纵功能。 本发明的数据库还提供了具有模块级分辨率的内置安全机制。
    • 7. 发明申请
    • METHOD OF PERFORMING A SLIDING WINDOW SEARCH
    • 执行滑动窗口搜索的方法
    • WO00007085A2
    • 2000-02-10
    • PCT/US1999/017240
    • 1999-07-29
    • G06F17/30G06F
    • G06F17/30985Y10S707/961Y10S707/99936
    • A method of performing a sliding window search includes the steps of : creating an associative database of a plurality of data strings (42), receiving a first window of a data block (44), iconizing the first window of the data block to form a first icon (46), determining if the first icon has a match in the associative database (48), determining a first byte icon of a first byte of data in the first window (50), executing an icon shift function to form a shifted first byte icon, (52) exclusive ORing the shifted first byte icon with the first icon to form a seed icon (54), determining a second icon for a second window using the seed icon and transforming a new byte of data onto the seed icon (56), and determining if the second icon has a match in the associative database (58).
    • 执行滑动窗口搜索的方法包括以下步骤:创建多个数据串(42)的关联数据库,接收数据块(44)的第一窗口,图标化数据块的第一窗口以形成 第一图标(46),确定所述第一图标在所述关联数据库(48)中是否具有匹配,确定所述第一窗口(50)中的第一字节数据的第一字节图标,执行图标移位功能以形成移位 第一字节图标,(52)将所移动的第一字节图标与第一图标异或以形成种子图标(54),使用种子图标确定用于第二窗口的第二图标,并将数据的新字节变换到种子图标 (56),并且确定所述第二图标在所述关联数据库(58)中是否具有匹配。
    • 8. 发明申请
    • A NOVEL DATABASE
    • 一个新的数据库
    • WO2008041242A4
    • 2009-01-15
    • PCT/IN2007000426
    • 2007-09-21
    • BRAINWAVE APPLIC LTDSUREKA PRATEEK
    • SUREKA PRATEEK
    • G06F12/00G06F15/16
    • G06F17/30587Y10S707/961
    • The present invention provides a non-relational transactional and analytical database. It has a novel data architecture that allows data to persist without requiring any schema definition. The database of the present invention also provides a file system with in-built versioning, reliability and security and can be deployed in a distributed environment. The approach adopted in the present invention is to break down data into its fundamental atomic components, called memes, and use a special type of graph (utilizing non-standard vertices and edges) to create logical relationships, represented by links, between these components. The database operational functionality is deployed through an application program interface (API) using the query language that is based on recursive triplets of the form (subject, verb, object). The memes and links are identified with Universally Unique Identifiers (UUIDs). The database of the present invention also provides file system manipulation functionality through the use of UUIDs. The database of the present invention also provides a built-in security mechanism with meme level resolution.
    • 本发明提供了非关系事务和分析数据库。 它具有一种新颖的数据架构,允许数据持久化,而不需要任何模式定义。 本发明的数据库还提供具有内置版本,可靠性和安全性的文件系统,并且可以部署在分布式环境中。 本发明采用的方法是将数据分解为其基本原子分量(称为模型),并使用特殊类型的图(利用非标准顶点和边)来创建由这些组件之间的链接表示的逻辑关系。 通过应用程序接口(API)部署数据库操作功能,该应用程序接口(API)使用基于形式(主语,动词,对象)的递归三元组的查询语言。 模块和链接用通用唯一标识符(UUID)标识。 本发明的数据库还通过使用UUID来提供文件系统操纵功能。 本发明的数据库还提供了具有记忆级分辨率的内置安全机制。
    • 9. 发明申请
    • A NOVEL DATABASE
    • 一个新的数据库
    • WO2008041242A3
    • 2008-11-13
    • PCT/IN2007000426
    • 2007-09-21
    • BRAINWAVE APPLIC LTDSUREKA PRATEEK
    • SUREKA PRATEEK
    • G06F12/00G06F15/16
    • G06F17/30587Y10S707/961
    • The present invention provides a non-relational transactional and analytical database. It has a novel data architecture that allows data to persist without requiring any schema definition. The database of the present invention also provides a file system with in-built versioning, reliability and security and can be deployed in a distributed environment. The approach adopted in the present invention is to break down data into its fundamental atomic components, called memes, and use a special type of graph (utilizing non-standard vertices and edges) to create logical relationships, represented by links, between these components. The database operational functionality is deployed through an application program interface (API) using the query language that is based on recursive triplets of the form (subject, verb, object). The memes and links are identified with Universally Unique Identifiers (UUIDs). The database of the present invention also provides file system manipulation functionality through the use of UUIDs. The database of the present invention also provides a built-in security mechanism with meme level resolution.
    • 本发明提供了一种非关系事务和分析数据库。 它有一个新颖的数据架构,允许数据在不需要任何架构定义的情况下持续存在。 本发明的数据库还提供了具有内置版本控制,可靠性和安全性的文件系统,并且可以部署在分布式环境中。 本发明采用的方法是将数据分解成其基本原子成分,称为模因子,并使用特殊类型的图(利用非标准顶点和边)来创建这些成分之间由链接表示的逻辑关系。 数据库操作功能通过应用程序接口(API)使用基于表单(主题,动词,对象)的递归三元组的查询语言进行部署。 模因和链接用通用唯一标识符(UUID)标识。 本发明的数据库还通过使用UUID提供文件系统操作功能。 本发明的数据库还提供具有模糊等级分辨率的内置安全机制。