System and method of efficiently representing and searching directed acyclic graph structures in databases

A database and indexing technology, applied in the field of data structure, can solve problems such as low efficiency and low efficiency, and achieve the effect of improving efficiency and fast reasoning

Inactive Publication Date: 2009-04-29
ADOBE INC
View PDF1 Cites 26 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Adjacency lists typically require navigating the stored DAG structure and tend to be inefficient for larger graphs
Insertion, update, and deletion are relatively efficient, however, traversing large parts of ontology knowledge structures stored using adjacency lists is inefficient

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • System and method of efficiently representing and searching directed acyclic graph structures in databases
  • System and method of efficiently representing and searching directed acyclic graph structures in databases
  • System and method of efficiently representing and searching directed acyclic graph structures in databases

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] The term "document" used in this manual refers to electronic documents. An electronic document (simply referred to as a document for brevity) need not correspond to a file. Documents can be stored in a part of a file that holds other documents, in a single file for the document in question or in multiple coordinated files. The term "generic directed acyclic graph (DAG)" refers to a DAG structure (directed arcs and no cycles) in which a child node can have multiple parents. "Tree" refers to a DAG structure in which each node can only have one parent node. "Graphs" include trees and generic DAGs.

[0033] Additionally, "database" refers to a collection of comprehensive records maintained in long-term storage (ie, in large data stores, such as hard drive systems, not just in memory data structures). "Database Management System" means the collection of programs used to define, manage and process databases and any related program applications. "Relational database" means...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present disclosure includes systems and techniques relating to representation and retrieval of data structures in databases. In general, embodiments of the invention feature a computer program product and a method including storing a generalized directed acyclic graph (DAG) in a database, wherein the storing includes encoding path information of the generalized DAG in entries of a path table in the database, the encoding includes converting the path information into text strings, and the entries of the path table correspond to paths in the generalized DAG from nodes of the generalized DAG to a root node of the generalized DAG; triggering generation of a lexical index of the path table using the text strings, wherein the lexical index separately lists tokens included in the entries; and retrieving one or more portions of the generalized DAG from the database for in-memory operations.

Description

[0001] Cross References to Related Applications [0002] This application claims priority to U.S. Provisional Patent Application Serial No. 60 / 778,869, filed March 3, 2006 (Express Mail Label EV 471533919 US), entitled " (System and Method for Efficiently Representing and Searching Directed Acyclic Graph Structures in Databases)"; and this application is related to U.S. Patent Application Serial No. 11 / 368,130, filed March 3, 2006 (Express Mail Label No. EV 471533922 US), named " (System and Method for Constructing and Using Hierarchical Knowledge Structures)". The above-mentioned application is hereby incorporated by reference in its entirety as an integral part of the present invention. technical field [0003] The present invention relates to representing and retrieving data structures in databases. Background technique [0004] Traditionally, stored knowledge is often represented in a directed acyclic graph (DAG) structure, known as a semantic network, and more ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor W·常N·格哈姆拉维A·斯沃米
Owner ADOBE INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap