知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.031 seconds)

    SCALABLE, SCHEMALESS DOCUMENT QUERY MODEL
    2.
    发明申请
    SCALABLE, SCHEMALESS DOCUMENT QUERY MODEL 审中-公开
    可扩展的，计划文件查询模型

    公开(公告)号：US20160117320A1

    公开(公告)日：2016-04-28

    申请号：US14986997

    申请日：2016-01-04

    Applicant: Microsoft Technology Licensing, LLC

    Inventor： Dharma Shukla ,  Madhan Gajendran ,  Quetzalcoatl Bradley ,  Shireesh Kumar Thota ,  Li Zhang ,  Mihai Dan Budiu ,  Yuan Yu

    IPC: G06F17/30

    CPC classification number: G06F17/30011 ,  G06F17/30321 ,  G06F17/30486 ,  G06F17/30554 ,  G06F17/30964

    Abstract: Query models for document sets (such as XML documents or records in a relational database) typically involve a schema defining the structure of the documents. However, rigidly defined schemas often raise difficulties with document validation with even inconsequential structural variations. Additionally, queries developed against schema-constrained documents are often sensitive to structural details and variations that are not inconsequential to the query, resulting in inaccurate results and development complications, and that may break upon schema changes. Instead, query models for hierarchically structured documents that enable “twig” queries specifying only the structural details of document nodes that are relevant to the query (e.g., students in a student database having a sibling named “Lee” and a teacher named “Smith,” irrespective of unrelated structural details of the document). Such “twig” query models may enable a more natural query development, and continued accuracy of queries in the event of unrelated schema variations and changes.

    Abstract translation: 文档集（如关系数据库中的XML文档或记录）的查询模型通常涉及定义文档结构的模式。 然而，刚性定义的模式通常会导致文档验证的困难，甚至无关紧要的结构变化。 另外，针对模式约束的文档开发的查询通常对结构细节和对查询不重要的变体敏感，导致不准确的结果和开发复杂性，并且可能会破坏模式更改。 相反，用于分层结构化文档的查询模型，使得“twig”查询仅指定与查询相关的文档节点的结构细节（例如，具有名为“Lee”的兄弟姐妹的学生数据库中的学生和名为“Smith”的教师， “不管文件的不相关的结构细节如何）。 这种“twig”查询模型可以实现更自然的查询开发，以及在不相关的模式变化和变化的情况下，查询的持续准确性。

    SMART ERROR RECOVERY FOR DATABASE APPLICATIONS
    7.
    发明申请
    SMART ERROR RECOVERY FOR DATABASE APPLICATIONS 有权
    智能错误恢复数据库应用程序

    公开(公告)号：US20160103731A1

    公开(公告)日：2016-04-14

    申请号：US14973267

    申请日：2015-12-17

    Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

    Inventor： Matthew A. Neerincx ,  Luiz F. Santos ,  Oleg Ignat ,  David B. Lomet ,  Quetzalcoatl Bradley ,  Raghu Ram ,  Chadwin J. Mumford ,  Peter Gvozdjak ,  Balendran Mugundan

    IPC: G06F11/07

    CPC classification number: G06F11/0793 ,  G06F11/0709 ,  H04L69/40

    Abstract: A database server includes logic that is operable to monitor and analyze at least events occurring within an environment of the database server and/or execution errors generated by the database server in order to detect whether a problem condition exists. The database server further includes logic that is operable to send one or more commands to a database driver of a client that is communicatively connected to the database server, the one or more commands specifying one or more actions to be taken by the database driver in response to the existence of the problem condition. The database driver includes logic that is operable to receive the one or more commands from the database server and logic that is operable to cause the one or more commands to be executed.

    Abstract translation: 数据库服务器包括可操作以监视和分析在数据库服务器的环境内发生的至少事件和/或由数据库服务器生成的执行错误以检测是否存在问题条件的逻辑。 数据库服务器还包括可操作以将一个或多个命令发送到通信地连接到数据库服务器的客户端的数据库驱动器的逻辑，所述一个或多个命令指定数据库驱动器响应的一个或多个动作 存在问题的条件。 数据库驱动器包括可操作以从数据库服务器接收一个或多个命令的逻辑和可操作以使得执行一个或多个命令的逻辑。

    Programming model for performant computing in document-oriented storage services
    8.
    发明授权
    Programming model for performant computing in document-oriented storage services 有权

    公开(公告)号：US10817312B2

    公开(公告)日：2020-10-27

    申请号：US13827917

    申请日：2013-03-14

    Applicant: Microsoft Technology Licensing, LLC

    Inventor： Dharma Shukla ,  Madhan Gajendran ,  Quetzalcoatl Bradley

    IPC: G06F9/44 ,  G06F9/448 ,  G06F9/455

    Abstract: Object-oriented application languages often provide resources to applications for accessing objects stored in the volatile application memory region, and, separately, for packaging objects for persistent storage and network transport by serialization and deserialization involving a storage format. However, this design creates discrepancies between the application language and storage format, and depends on affirmative serialization and deserialization by the application. Presented herein are techniques for providing object access to objects involving persisting the objects as documents in a document store, where such persistence occurs automatically upon object creation and updating, and where such objects are stored in a language format integral to the application language (e.g., when a JavaScript application creates an object, the objects are automatically stored as documents of the document store in a JavaScript Object Notation (JSON) format). This design enables various advantages in efficiency, flexibility, and seamless interaction between the application and the objects.

    Scalable, schemaless document query model
    10.
    发明授权
    Scalable, schemaless document query model 有权

    公开(公告)号：US09852133B2

    公开(公告)日：2017-12-26

    申请号：US14986997

    申请日：2016-01-04

    Applicant: Microsoft Technology Licensing, LLC

    Inventor： Dharma Shukla ,  Madhan Gajendran ,  Quetzalcoatl Bradley ,  Shireesh Kumar Thota ,  Li Zhang ,  Mihai Dan Budiu ,  Yuan Yu

    IPC: G06F7/00 ,  G06F17/30

    CPC classification number: G06F17/30011 ,  G06F17/30321 ,  G06F17/30486 ,  G06F17/30554 ,  G06F17/30964

    Abstract: Query models for document sets (such as XML documents or records in a relational database) typically involve a schema defining the structure of the documents. However, rigidly defined schemas often raise difficulties with document validation with even inconsequential structural variations. Additionally, queries developed against schema-constrained documents are often sensitive to structural details and variations that are not inconsequential to the query, resulting in inaccurate results and development complications, and that may break upon schema changes. Instead, query models for hierarchically structured documents that enable “twig” queries specifying only the structural details of document nodes that are relevant to the query (e.g., students in a student database having a sibling named “Lee” and a teacher named “Smith,” irrespective of unrelated structural details of the document). Such “twig” query models may enable a more natural query development, and continued accuracy of queries in the event of unrelated schema variations and changes.

Patent Agency Ranking