US20230059083A1 - Generating shortcut paths between related data types - Google Patents

Generating shortcut paths between related data types Download PDF

Info

Publication number
US20230059083A1
US20230059083A1 US17/409,299 US202117409299A US2023059083A1 US 20230059083 A1 US20230059083 A1 US 20230059083A1 US 202117409299 A US202117409299 A US 202117409299A US 2023059083 A1 US2023059083 A1 US 2023059083A1
Authority
US
United States
Prior art keywords
data
data type
edges
directed
data model
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US17/409,299
Other languages
English (en)
Inventor
Harsh Verma
Ramakrishna Casturi
Tyler James-Buker Doyle
Arun Durairaju
Tao Tao
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tableau Software LLC
Original Assignee
Tableau Software LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tableau Software LLC filed Critical Tableau Software LLC
Priority to US17/409,299 priority Critical patent/US20230059083A1/en
Assigned to Tableau Software, LLC reassignment Tableau Software, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CASTURI, RAMAKRISHNA, DOYLE, TYLER JAMES-BUKER, DURAIRAJU, ARUN, TAO, TAO, VERMA, HARSH
Priority to PCT/US2022/038328 priority patent/WO2023027851A1/en
Priority to JP2024512102A priority patent/JP2024536692A/ja
Priority to CN202280061654.8A priority patent/CN117999549A/zh
Priority to EP22761669.5A priority patent/EP4392872A1/en
Publication of US20230059083A1 publication Critical patent/US20230059083A1/en
Priority to US18/540,844 priority patent/US20240111791A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21—Design, administration or maintenance of databases
    • G06F16/211—Schema design and management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases
    • G06F16/288—Entity relationship models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2291—User-Defined Types; Storage management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/242—Query formulation
    • G06F16/2423—Interactive query statement specification based on a database schema
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/248—Presentation of query results
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/25—Integrating or interfacing systems involving database management systems
    • G06F16/254—Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/26—Visual data mining; Browsing structured data

Definitions

  • the present invention relates generally to data visualization, and more particularly, but not exclusively, to managing the data associated with objects included in visualizations.
  • This data may be associated with disparate parts of the organization, such as, consumer activity, manufacturing activity, customer service, server logs, or the like. For various reasons, it may be inconvenient for such organizations to effectively utilize their vast collections of data. In some cases the quantity of data may make it difficult to effectively utilize the collected data to improve business practices. Accordingly, in some cases, organizations may employ various applications or tools to generate visualizations based on some or all of their data. Employing visualizations to represent data may enable organizations to improve their understanding of business operations, sales, customer information, employee information, key performance indicators, or the like. In some cases, sophisticated visualizations may incorporate or otherwise depend on data from a variety of sources within an organization, including different databases.
  • many different visualizations may depend on these varied or disparate data sources. Often it may be important to enable to users to identify relationships between different dependent objects that may be used for interacting with those objects. In some cases, manual determination of relationships between some different data types may be prone to error because of the many varied or disparate data types that may be represented. Thus, it is with respect to these considerations and others that the present invention has been made.
  • FIG. 1 illustrates a system environment in which various embodiments may be implemented
  • FIG. 2 illustrates a schematic embodiment of a client computer
  • FIG. 3 illustrates a schematic embodiment of a network computer
  • FIG. 4 illustrates a logical architecture of a system for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 5 illustrates a logical schematic of data types 500 for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 6 illustrates a logical schematic of schema model 600 for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 7 illustrates a logical schematic of a closure that may be a portion of a data model in accordance with one or more of the various embodiments
  • FIG. 8 illustrates a representation of a data structure for representing data flow boundaries for data models in accordance with one or more of the various embodiments
  • FIG. 9 illustrates a representation of a data structure for representing closure hints for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 10 illustrates an overview flowchart of a process for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 11 illustrates a flowchart of a process for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 12 illustrates a flowchart of a process for generating closures for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 13 illustrates a flowchart of a process for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 14 illustrates a flowchart of a process for generating closures for generating shortcut paths between related data types in accordance with one or more of the various embodiments
  • FIG. 15 illustrates a flowchart of a process for substituting persistent shortcuts for runtime generated shortcut paths in accordance with one or more of the various embodiments.
  • FIG. 16 illustrates a flowchart of a process for processing queries based on shortcut paths between related data types in accordance with one or more of the various embodiments.
  • the term “or” is an inclusive “or” operator, and is equivalent to the term “and/or,” unless the context clearly dictates otherwise.
  • the term “based on” is not exclusive and allows for being based on additional factors not described, unless the context clearly dictates otherwise.
  • the meaning of “a,” “an,” and “the” include plural references.
  • the meaning of “in” includes “in” and “on.”
  • engine refers to logic embodied in hardware or software instructions, which can be written in a programming language, such as C, C++, Objective-C, COBOL, JavaTM, Kotlin, PHP, Perl, JavaScript, Ruby, VBScript, Microsoft .NETTM languages such as C#, or the like.
  • An engine may be compiled into executable programs or written in interpreted programming languages.
  • Software engines may be callable from other engines or from themselves.
  • Engines described herein refer to one or more logical modules that can be merged with other engines or applications, or can be divided into sub-engines.
  • the engines can be stored in non-transitory computer-readable medium or computer storage device and be stored on and executed by one or more general purpose computers, thus creating a special purpose computer configured to provide the engine.
  • one or more portions of an engine may be a hardware device, ASIC, FPGA, or the like, that performs one or more actions in the support of an engine or as part of the engine.
  • data model refers to one or more data structures that represent one or more entities associated with data collected or maintained by an organization.
  • Data models are typically arranged to model various operations or activities associated with an organization.
  • data models are arranged to provide or facilitate various data-focused actions, such as, efficient storage, queries, indexing, search, updates, or the like.
  • a data model may be arranged to provide features related to data manipulation or data management rather than providing an easy to understand presentation or visualizations of the data.
  • data object refers to one or more entities or data structures that comprise data models. In some cases, data objects may be considered portions of the data model. Data objects may represent classes or kinds of items, such as, databases, data-sources, tables, workbooks, visualizations, work-flows, or the like.
  • data object class or “object class” refers to a one or more entities or data structures that represent a class, kind, or type of data objects.
  • data type refers a data object that represents a class or kind of data objects.
  • Table and Column may each be data types while Table A and Column B of Table A may be considered instances of data type Table and data type Column respectively.
  • Schema model refers to data structures the represent the various data types and relationships between those data types. Schema models may be considered data models that define data types, data type relationships, and so on.
  • closure refers to a portion of nodes and edges of a schema model that may be separated by a data flow boundary. In some cases, closures may be informally considered to be partitions of a schema model. Schema models may declare more than one closure.
  • data flow boundary As used herein the terms “data flow boundary,” “flow boundary,” or “flow” refer an edge in a schema model that may be defined to separate portions of the schema model into closures. Schema models may declare more than one flow boundaries.
  • shortcut refers to declared directed path in a schema model that extends from a source data type node to a target data type node. Shortcut definitions may include at least a source data type, a target data type, and a path direction. Thus, a fully realized shortcut is a path in the schema model from a source data type to a target data type that is comprised of edges and nodes in the schema model.
  • display model refers to one or more data structures that represent one or more representations of a data model that may be suitable for use in a visualization that is displayed on one or more hardware displays.
  • Display models may define styling or user interface features that may be made available to non-authoring user.
  • display object refers to one or more data structures that comprise display models.
  • display objects may be considered portions of the display model.
  • Display objects may represent individual instances of items or entire classes or kinds of items that may be displayed in a visualization.
  • display objects may be considered or referred to as views because they provide a view of some portion of the data model.
  • panel refers to region within a graphical user interface (GUI) that has a defined geometry (e.g., x, y, z-order) within the GUI.
  • GUI graphical user interface
  • Panels may be arranged to display information to users or to host one or more interactive controls.
  • the geometry or styles associated with panels may be defined using configuration information, including dynamic rules.
  • users may be enabled to perform actions on one or more panels, such as, moving, showing, hiding, re-sizing, re-ordering, or the like.
  • configuration information refers to information that may include rule based policies, pattern matching, scripts (e.g., computer readable instructions), or the like, that may be provided from various sources, including, configuration files, databases, user input, built-in defaults, or the like, or combination thereof.
  • various embodiments are directed to managing data using a network computers.
  • a data model that includes one or more data types, one or more data type relationships, one or more shortcuts, or the like, may be provided such that each data type may be represented by a node in the data model and each data type relationship may be represented by a pair of opposite sense directed edges edge in the data model.
  • further actions may be performed including: determining a current source data type and a current target data type based on the shortcut; determining one or more candidate nodes and one or more traversal edges based on the data model, the current target data type, and the current source data type such that each traversal edge may correspond to a data type relationship between two data types included in the data model, the one or more candidate nodes and the one or more traversal edges; generating a tree based on the one or more candidate nodes and the one or more traversal edges; removing one or more leaf nodes of the tree such that one or more remaining leaf nodes may correspond to the current target data type; removing one or more branches of the tree such that the one or more removed branches may correspond to one or more duplicate traversal edges in the tree; determining the directed path in the data model connecting the current source data type to the current target data type based on a remainder of the one or more candidate nodes in the tree
  • determining the one or more candidate nodes and the one or more traversal edges may include: providing one or more closure source data types, one or more closure target data types, and one of more directed closure edges that may be associated with the data model; generating one or more closures based on the one or more closure source data types, the one or more closure target data types, and the one of more directed closure edges; determining the one or more candidate nodes based a portion of the one or more closures associated with the target data type and the source data type; determining the one or more traversal edges based on the portion of the one or more closures; or the like.
  • determining the one or more traversal edges may include: providing one or more flow source data types, one or more flow target data types, and one of more directed flow edges that are associated with the data model; generating one or more flow boundaries based on the one or more flow source data types, the one or more flow target data types, and the one of more directed flow edges such that each flow boundary indicates a transition boundary between the one or more data types in the data model; adding the one or more directed flow edges to the one or more traversal edges; or the like.
  • a data store may be employed to provide one or more persisted shortcuts associated with the data model such that each persisted shortcut may provide another directed path between another source data type and another target data type; and, in response to determining one or more portions of the directed path that correspond to the one or more persisted shortcuts, substituting the corresponding one or more persisted shortcuts for the one or more portions of the directed path.
  • the data model may be modified based on including one or more other data types or including one or more other data type relationships.
  • another directed path may be generated based on the modified data model and the one or more shortcuts.
  • the other directed path may be provided as a substitute to the directed path.
  • providing the data model may include automatically generating one or more directed paths for each shortcut in the absence of the query.
  • providing the data model may include: providing one or more compound data types that may be comprised of one or more other data types; and providing more than one node in the data model that may represent a same data type.
  • FIG. 1 shows components of one embodiment of an environment in which embodiments of the invention may be practiced. Not all of the components may be required to practice the invention, and variations in the arrangement and type of the components may be made without departing from the spirit or scope of the invention.
  • system 100 of FIG. 1 includes local area networks (LANs)/wide area networks (WANs)—(network) 110 , wireless network 108 , client computers 102 - 105 , visualization server computer 116 , or the like.
  • LANs local area networks
  • WANs wide area networks
  • client computers 102 - 105 may operate over one or more wired or wireless networks, such as networks 108 , or 110 .
  • client computers 102 - 105 may include virtually any computer capable of communicating over a network to send and receive information, perform various online activities, offline actions, or the like.
  • one or more of client computers 102 - 105 may be configured to operate within a business or other entity to perform a variety of services for the business or other entity.
  • client computers 102 - 105 may be configured to operate as a web server, firewall, client application, media player, mobile telephone, game console, desktop computer, or the like.
  • client computers 102 - 105 are not constrained to these services and may also be employed, for example, as for end-user computing in other embodiments. It should be recognized that more or less client computers (as shown in FIG. 1 ) may be included within a system such as described herein, and embodiments are therefore not constrained by the number or type of client computers employed.
  • Computers that may operate as client computer 102 may include computers that typically connect using a wired or wireless communications medium such as personal computers, multiprocessor systems, microprocessor-based or programmable electronic devices, network PCs, or the like.
  • client computers 102 - 105 may include virtually any portable computer capable of connecting to another computer and receiving information such as, laptop computer 103 , mobile computer 104 , tablet computers 105 , or the like.
  • portable computers are not so limited and may also include other portable computers such as cellular telephones, display pagers, radio frequency (RF) devices, infrared (IR) devices, Personal Digital
  • RF radio frequency
  • IR infrared
  • client computers 102 - 105 typically range widely in terms of capabilities and features. Moreover, client computers 102 - 105 may access various computing applications, including a browser, or other web-based application.
  • a web-enabled client computer may include a browser application that is configured to send requests and receive responses over the web.
  • the browser application may be configured to receive and display graphics, text, multimedia, and the like, employing virtually any web-based language.
  • the browser application is enabled to employ JavaScript, HyperText Markup Language (HTML), eXtensible Markup Language (XML), JavaScript Object Notation (JSON), Cascading Style Sheets (CSS), or the like, or combination thereof, to display and send a message.
  • a user of the client computer may employ the browser application to perform various activities over a network (online). However, another application may also be used to perform various online activities.
  • Client computers 102 - 105 also may include at least one other client application that is configured to receive or send content between another computer.
  • the client application may include a capability to send or receive content, or the like.
  • the client application may further provide information that identifies itself, including a type, capability, name, and the like.
  • client computers 102 - 105 may uniquely identify themselves through any of a variety of mechanisms, including an Internet Protocol (IP) address, a phone number, Mobile Identification Number (MIN), an electronic serial number (ESN), a client certificate, or other device identifier.
  • IP Internet Protocol
  • MIN Mobile Identification Number
  • ESN electronic serial number
  • client certificate or other device identifier.
  • Such information may be provided in one or more network packets, or the like, sent between other client computers, visualization server computer 116 , or other computers.
  • Client computers 102 - 105 may further be configured to include a client application that enables an end-user to log into an end-user account that may be managed by another computer, such as visualization server computer 116 , or the like.
  • a client application that enables an end-user to log into an end-user account that may be managed by another computer, such as visualization server computer 116 , or the like.
  • Such an end-user account in one non-limiting example, may be configured to enable the end-user to manage one or more online activities, including in one non-limiting example, project management, software development, system administration, configuration management, search activities, social networking activities, browse various websites, communicate with other users, or the like.
  • client computers may be arranged to enable users to display reports, interactive user-interfaces, or results provided by visualization server computer 116 .
  • Wireless network 108 is configured to couple client computers 103 - 105 and its components with network 110 .
  • Wireless network 108 may include any of a variety of wireless sub-networks that may further overlay stand-alone ad-hoc networks, and the like, to provide an infrastructure-oriented connection for client computers 103 - 105 .
  • Such sub-networks may include mesh networks, Wireless LAN (WLAN) networks, cellular networks, and the like.
  • the system may include more than one wireless network.
  • Wireless network 108 may further include an autonomous system of terminals, gateways, routers, and the like connected by wireless radio links, and the like. These connectors may be configured to move freely and randomly and organize themselves arbitrarily, such that the topology of wireless network 108 may change rapidly.
  • Wireless network 108 may further employ a plurality of access technologies including 2nd (2G), 3rd (3G), 4th (4G) 5th (5G) generation radio access for cellular systems, WLAN, Wireless Router (WR) mesh, and the like.
  • Access technologies such as 2G, 3G, 4G, 5G, and future access networks may enable wide area coverage for mobile computers, such as client computers 103 - 105 with various degrees of mobility.
  • wireless network 108 may enable a radio connection through a radio network access such as Global System for Mobil communication (GSM), General Packet Radio Services (GPRS), Enhanced Data GSM Environment (EDGE), code division multiple access (CDMA), time division multiple access (TDMA), Wideband Code Division Multiple Access (WCDMA), High Speed Downlink Packet Access (HSDPA), Long Term Evolution (LTE), and the like.
  • GSM Global System for Mobil communication
  • GPRS General Packet Radio Services
  • EDGE Enhanced Data GSM Environment
  • CDMA code division multiple access
  • TDMA time division multiple access
  • WCDMA Wideband Code Division Multiple Access
  • HSDPA High Speed Downlink Packet Access
  • LTE Long Term Evolution
  • Network 110 is configured to couple network computers with other computers, including, visualization server computer 116 , client computers 102 , and client computers 103 - 105 through wireless network 108 , or the like.
  • Network 110 is enabled to employ any form of computer readable media for communicating information from one electronic device to another.
  • network 110 can include the Internet in addition to local area networks (LANs), wide area networks (WANs), direct connections, such as through a universal serial bus (USB) port, Ethernet port, other forms of computer-readable media, or any combination thereof.
  • LANs local area networks
  • WANs wide area networks
  • USB universal serial bus
  • Ethernet port such as Ethernet port
  • a router acts as a link between LANs, enabling messages to be sent from one to another.
  • communication links within LANs typically include twisted wire pair or coaxial cable
  • communication links between networks may utilize analog telephone lines, full or fractional dedicated digital lines including T 1 , T 2 , T 3 , and T 4 , or other carrier mechanisms including, for example, E-carriers, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links, or other communications links known to those skilled in the art.
  • ISDNs Integrated Services Digital Networks
  • DSLs Digital Subscriber Lines
  • communication links may further employ any of a variety of digital signaling technologies, including without limit, for example, DS- 0 , DS- 1 , DS- 2 , DS- 3 , DS- 4 , OC- 3 , OC- 12 , OC- 48 , or the like.
  • remote computers and other related electronic devices could be remotely connected to either LANs or WANs via a modem and temporary telephone link.
  • network 110 may be configured to transport information of an Internet Protocol (IP
  • communication media typically embodies computer readable instructions, data structures, program modules, or other transport mechanism and includes any information non-transitory delivery media or transitory delivery media.
  • communication media includes wired media such as twisted pair, coaxial cable, fiber optics, wave guides, and other wired media and wireless media such as acoustic, RF, infrared, and other wireless media.
  • visualization server computer 116 is described in more detail below in conjunction with FIG. 3 .
  • FIG. 1 illustrates visualization server computer 116 as a single computer, the innovations or embodiments are not so limited.
  • one or more functions of visualization server computer 116 , or the like may be distributed across one or more distinct network computers.
  • visualization server computer 116 may be implemented using a plurality of network computers.
  • visualization server computer 116 may be implemented using one or more cloud instances in one or more cloud networks. Accordingly, these innovations and embodiments are not to be construed as being limited to a single environment, and other configurations, and other architectures are also envisaged.
  • FIG. 2 shows one embodiment of client computer 200 that may include many more or less components than those shown.
  • Client computer 200 may represent, for example, one or more embodiment of mobile computers or client computers shown in FIG. 1 .
  • Client computer 200 may include processor 202 in communication with memory 204 via bus 228 .
  • Client computer 200 may also include power supply 230 , network interface 232 , audio interface 256 , display 250 , keypad 252 , illuminator 254 , video interface 242 , input/output interface 238 , haptic interface 264 , global positioning systems (GPS) receiver 258 , open air gesture interface 260 , temperature interface 262 , camera(s) 240 , projector 246 , pointing device interface 266 , processor-readable stationary storage device 234 , and processor-readable removable storage device 236 .
  • Client computer 200 may optionally communicate with a base station (not shown), or directly with another computer. And in one embodiment, although not shown, a gyroscope may be employed within client computer 200 to measuring or maintaining an orientation of client computer 200 .
  • Power supply 230 may provide power to client computer 200 .
  • a rechargeable or non-rechargeable battery may be used to provide power.
  • the power may also be provided by an external power source, such as an AC adapter or a powered docking cradle that supplements or recharges the battery.
  • Network interface 232 includes circuitry for coupling client computer 200 to one or more networks, and is constructed for use with one or more communication protocols and technologies including, but not limited to, protocols and technologies that implement any portion of the OSI model for mobile communication (GSM), CDMA, time division multiple access (TDMA), UDP, TCP/IP, SMS, MMS, GPRS, WAP, UWB, WiMax, SIP/RTP, GPRS, EDGE, WCDMA, LTE, UMTS, OFDM, CDMA2000, EV-DO, HSDPA, or any of a variety of other wireless communication protocols.
  • GSM OSI model for mobile communication
  • CDMA Code Division Multiple Access
  • TDMA time division multiple access
  • UDP User Datagram Protocol/IP
  • SMS SMS
  • MMS mobility management Entity
  • GPRS Wireless Fidelity
  • WAP Wireless Fidelity
  • UWB Wireless Fidelity
  • Audio interface 256 may be arranged to produce and receive audio signals such as the sound of a human voice.
  • audio interface 256 may be coupled to a speaker and microphone (not shown) to enable telecommunication with others or generate an audio acknowledgment for some action.
  • a microphone in audio interface 256 can also be used for input to or control of client computer 200 , e.g., using voice recognition, detecting touch based on sound, and the like.
  • Display 250 may be a liquid crystal display (LCD), gas plasma, electronic ink, light emitting diode (LED), Organic LED (OLED) or any other type of light reflective or light transmissive display that can be used with a computer.
  • Display 250 may also include a touch interface 244 arranged to receive input from an object such as a stylus or a digit from a human hand, and may use resistive, capacitive, surface acoustic wave (SAW), infrared, radar, or other technologies to sense touch or gestures.
  • SAW surface acoustic wave
  • Projector 246 may be a remote handheld projector or an integrated projector that is capable of projecting an image on a remote wall or any other reflective object such as a remote screen.
  • Video interface 242 may be arranged to capture video images, such as a still photo, a video segment, an infrared video, or the like.
  • video interface 242 may be coupled to a digital video camera, a web-camera, or the like.
  • Video interface 242 may comprise a lens, an image sensor, and other electronics.
  • Image sensors may include a complementary metal-oxide-semiconductor
  • CMOS complementary metal-oxide-semiconductor
  • CCD charge-coupled device
  • Keypad 252 may comprise any input device arranged to receive input from a user.
  • keypad 252 may include a push button numeric dial, or a keyboard.
  • Keypad 252 may also include command buttons that are associated with selecting and sending images.
  • Illuminator 254 may provide a status indication or provide light. Illuminator 254 may remain active for specific periods of time or in response to event messages. For example, when illuminator 254 is active, it may backlight the buttons on keypad 252 and stay on while the client computer is powered. Also, illuminator 254 may backlight these buttons in various patterns when particular actions are performed, such as dialing another client computer. Illuminator 254 may also cause light sources positioned within a transparent or translucent case of the client computer to illuminate in response to actions.
  • client computer 200 may also comprise hardware security module (HSM) 268 for providing additional tamper resistant safeguards for generating, storing or using security/cryptographic information such as, keys, digital certificates, passwords, passphrases, two-factor authentication information, or the like.
  • HSM hardware security module
  • hardware security module may be employed to support one or more standard public key infrastructures (PKI), and may be employed to generate, manage, or store keys pairs, or the like.
  • PKI public key infrastructure
  • HSM 268 may be a stand-alone computer, in other cases, HSM 268 may be arranged as a hardware card that may be added to a client computer.
  • Client computer 200 may also comprise input/output interface 238 for communicating with external peripheral devices or other computers such as other client computers and network computers.
  • the peripheral devices may include an audio headset, virtual reality headsets, display screen glasses, remote speaker system, remote speaker and microphone system, and the like.
  • Input/output interface 238 can utilize one or more technologies, such as Universal Serial Bus (USB), Infrared, WiFi, WiMax, BluetoothTM, and the like.
  • Input/output interface 238 may also include one or more sensors for determining geolocation information (e.g., GPS), monitoring electrical power conditions (e.g., voltage sensors, current sensors, frequency sensors, and so on), monitoring weather (e.g., thermostats, barometers, anemometers, humidity detectors, precipitation scales, or the like), or the like.
  • Sensors may be one or more hardware sensors that collect or measure data that is external to client computer 200 .
  • Haptic interface 264 may be arranged to provide tactile feedback to a user of the client computer.
  • the haptic interface 264 may be employed to vibrate client computer 200 in a particular way when another user of a computer is calling.
  • Temperature interface 262 may be used to provide a temperature measurement input or a temperature changing output to a user of client computer 200 .
  • Open air gesture interface 260 may sense physical gestures of a user of client computer 200 , for example, by using single or stereo video cameras, radar, a gyroscopic sensor inside a computer held or worn by the user, or the like.
  • Camera 240 may be used to track physical eye movements of a user of client computer 200 .
  • GPS transceiver 258 can determine the physical coordinates of client computer 200 on the surface of the Earth, which typically outputs a location as latitude and longitude values. GPS transceiver 258 can also employ other geo-positioning mechanisms, including, but not limited to, triangulation, assisted GPS (AGPS), Enhanced Observed Time Difference (E-OTD), Cell Identifier (CI), Service Area Identifier (SAI), Enhanced Timing Advance (ETA), Base Station Subsystem (BSS), or the like, to further determine the physical location of client computer 200 on the surface of the Earth. It is understood that under different conditions, GPS transceiver 258 can determine a physical location for client computer 200 . In one or more embodiment, however, client computer 200 may, through other components, provide other information that may be employed to determine a physical location of the client computer, including for example, a Media Access Control (MAC) address, IP address, and the like.
  • MAC Media Access Control
  • applications such as, operating system 206 , client display engine 222 , other client apps 224 , web browser 226 , or the like, may be arranged to employ geo-location information to select one or more localization features, such as, time zones, languages, currencies, calendar formatting, or the like. Localization features may be used in documents, visualizations, display objects, display models, action objects, user-interfaces, reports, as well as internal processes or databases.
  • geo-location information used for selecting localization information may be provided by GPS 258 .
  • geolocation information may include information provided using one or more geolocation protocols over the networks, such as, wireless network 108 or network 111 .
  • Human interface components can be peripheral devices that are physically separate from client computer 200 , allowing for remote input or output to client computer 200 .
  • information routed as described here through human interface components such as display 250 or keyboard 252 can instead be routed through network interface 232 to appropriate human interface components located remotely.
  • human interface peripheral components that may be remote include, but are not limited to, audio devices, pointing devices, keypads, displays, cameras, projectors, and the like. These peripheral components may communicate over a Pico Network such as BluetoothTM, ZigbeeTM and the like.
  • a client computer with such peripheral human interface components is a wearable computer, which might include a remote pico projector along with one or more cameras that remotely communicate with a separately located client computer to sense a user's gestures toward portions of an image projected by the pico projector onto a reflected surface such as a wall or the user's hand.
  • a client computer may include web browser application 226 that is configured to receive and to send web pages, web-based messages, graphics, text, multimedia, and the like.
  • the client computer's browser application may employ virtually any programming language, including a wireless application protocol messages (WAP), and the like.
  • WAP wireless application protocol
  • the browser application is enabled to employ Handheld Device Markup Language (HDML), Wireless Markup Language (WML), WMLScript, JavaScript, Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), eXtensible Markup Language (XML), HTML5, and the like.
  • HDML Handheld Device Markup Language
  • WML Wireless Markup Language
  • WMLScript Wireless Markup Language
  • JavaScript Standard Generalized Markup Language
  • SGML Standard Generalized Markup Language
  • HTML HyperText Markup Language
  • XML eXtensible Markup Language
  • HTML5 HyperText Markup Language
  • Memory 204 may include RAM, ROM, or other types of memory. Memory 204 illustrates an example of computer-readable storage media (devices) for storage of information such as computer-readable instructions, data structures, program modules or other data. Memory 204 may store BIOS 208 for controlling low-level operation of client computer 200 . The memory may also store operating system 206 for controlling the operation of client computer 200 . It will be appreciated that this component may include a general-purpose operating system such as a version of UNIX®, or Linux®, Microsoft Windows® or a specialized client computer communication operating system such as, AndroidTM, or the Apple® Corporation's iOS. The operating system may include, or interface with a Java virtual machine module that enables control of hardware components or operating system operations via Java application programs.
  • BIOS 208 for controlling low-level operation of client computer 200 .
  • the memory may also store operating system 206 for controlling the operation of client computer 200 . It will be appreciated that this component may include a general-purpose operating system such as a version of UNIX®, or Linux®,
  • Memory 204 may further include one or more data storage 210 , which can be utilized by client computer 200 to store, among other things, applications 220 or other data.
  • data storage 210 may also be employed to store information that describes various capabilities of client computer 200 . The information may then be provided to another device or computer based on any of a variety of methods, including being sent as part of a header during a communication, sent upon request, or the like.
  • Data storage 210 may also be employed to store social networking information including address books, buddy lists, aliases, user profile information, or the like.
  • Data storage 210 may further include program code, data, algorithms, and the like, for use by a processor, such as processor 202 to execute and perform actions.
  • data storage 210 might also be stored on another component of client computer 200 , including, but not limited to, non-transitory processor-readable removable storage device 236 , processor-readable stationary storage device 234 , or even external to the client computer.
  • Applications 220 may include computer executable instructions which, when executed by client computer 200 , transmit, receive, or otherwise process instructions and data.
  • Applications 220 may include, for example, client display engine 222 , other client applications 224 , web browser 226 , or the like.
  • Client computers may be arranged to exchange communications, such as, queries, searches, messages, notification messages, event messages, alerts, performance metrics, log data, API calls, or the like, combination thereof, with visualization server computers.
  • application programs include calendars, search programs, email client applications, IM applications, SMS applications, Voice Over Internet Protocol (VOIP) applications, contact managers, task managers, transcoders, database programs, word processing programs, security applications, spreadsheet programs, games, search programs, and so forth.
  • VOIP Voice Over Internet Protocol
  • client computer 200 may include an embedded logic hardware device instead of a CPU, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof.
  • the embedded logic hardware device may directly execute its embedded logic to perform actions.
  • client computer 200 may include one or more hardware microcontrollers instead of CPUs.
  • the one or more microcontrollers may directly execute their own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.
  • SOC System On a Chip
  • FIG. 3 shows one embodiment of network computer 300 that may be included in a system implementing one or more of the various embodiments.
  • Network computer 300 may include many more or less components than those shown in FIG. 3 . However, the components shown are sufficient to disclose an illustrative embodiment for practicing these innovations.
  • Network computer 300 may represent, for example, one embodiment of one or more visualization server computer 116 of FIG. 1 .
  • Network computers such as, network computer 300 may include a processor 302 that may be in communication with a memory 304 via a bus 328 .
  • processor 302 may be comprised of one or more hardware processors, or one or more processor cores.
  • one or more of the one or more processors may be specialized processors designed to perform one or more specialized actions, such as, those described herein.
  • Network computer 300 also includes a power supply 330 , network interface 332 , audio interface 356 , display 350 , keyboard 352 , input/output interface 338 , processor-readable stationary storage device 334 , and processor-readable removable storage device 336 .
  • Power supply 330 provides power to network computer 300 .
  • Network interface 332 includes circuitry for coupling network computer 300 to one or more networks, and is constructed for use with one or more communication protocols and technologies including, but not limited to, protocols and technologies that implement any portion of the Open Systems Interconnection model (OSI model), global system for mobile communication (GSM), code division multiple access (CDMA), time division multiple access (TDMA), user datagram protocol (UDP), transmission control protocol/Internet protocol (TCP/IP), Short Message Service (SMS), Multimedia Messaging Service (MMS), general packet radio service (GPRS), WAP, ultra-wide band (UWB), IEEE 802.16 Worldwide Interoperability for Microwave Access (WiMax), Session Initiation Protocol/Real-time Transport Protocol (SIP/RTP), or any of a variety of other wired and wireless communication protocols.
  • Network interface 332 is sometimes known as a transceiver, transceiving device, or network interface card (NIC).
  • Network computer 300 may optionally communicate with a base station (not shown), or directly with another computer.
  • Audio interface 356 is arranged to produce and receive audio signals such as the sound of a human voice.
  • audio interface 356 may be coupled to a speaker and microphone (not shown) to enable telecommunication with others or generate an audio acknowledgment for some action.
  • a microphone in audio interface 356 can also be used for input to or control of network computer 300 , for example, using voice recognition.
  • Display 350 may be a liquid crystal display (LCD), gas plasma, electronic ink, light emitting diode (LED), Organic LED (OLED) or any other type of light reflective or light transmissive display that can be used with a computer.
  • display 350 may be a handheld projector or pico projector capable of projecting an image on a wall or other object.
  • Network computer 300 may also comprise input/output interface 338 for communicating with external devices or computers not shown in FIG. 3 .
  • Input/output interface 338 can utilize one or more wired or wireless communication technologies, such as USBTM, FirewireTM, WiFi, WiMax, ThunderboltTM, Infrared, BluetoothTM, ZigbeeTM, serial port, parallel port, and the like.
  • input/output interface 338 may also include one or more sensors for determining geolocation information (e.g., GPS), monitoring electrical power conditions (e.g., voltage sensors, current sensors, frequency sensors, and so on), monitoring weather (e.g., thermostats, barometers, anemometers, humidity detectors, precipitation scales, or the like), or the like.
  • Sensors may be one or more hardware sensors that collect or measure data that is external to network computer 300 .
  • Human interface components can be physically separate from network computer 300 , allowing for remote input or output to network computer 300 . For example, information routed as described here through human interface components such as display 350 or keyboard 352 can instead be routed through the network interface 332 to appropriate human interface components located elsewhere on the network.
  • Human interface components include any component that allows the computer to take input from, or send output to, a human user of a computer. Accordingly, pointing devices such as mice, styluses, track balls, or the like, may communicate through pointing device interface 358 to receive user input.
  • GPS transceiver 340 can determine the physical coordinates of network computer 300 on the surface of the Earth, which typically outputs a location as latitude and longitude values. GPS transceiver 340 can also employ other geo-positioning mechanisms, including, but not limited to, triangulation, assisted GPS (AGPS), Enhanced Observed Time Difference (E-OTD), Cell Identifier (CI), Service Area Identifier (SAI), Enhanced Timing Advance (ETA), Base Station Subsystem
  • AGPS assisted GPS
  • E-OTD Enhanced Observed Time Difference
  • CI Cell Identifier
  • SAI Service Area Identifier
  • ETA Enhanced Timing Advance
  • GPS transceiver 340 can determine a physical location for network computer 300 .
  • network computer 300 may, through other components, provide other information that may be employed to determine a physical location of the client computer, including for example, a Media Access Control (MAC) address, IP address, and the like.
  • MAC Media Access Control
  • applications such as, operating system 306 , data management engine 322 , display engine 324 , lineage engine 326 , web services 329 , or the like, may be arranged to employ geo-location information to select one or more localization features, such as, time zones, languages, currencies, currency formatting, calendar formatting, or the like. Localization features may be used in documents, file systems, user-interfaces, reports, display objects, display models, visualizations as well as internal processes or databases.
  • geo-location information used for selecting localization information may be provided by GPS 340 .
  • geolocation information may include information provided using one or more geolocation protocols over the networks, such as, wireless network 108 or network 111 .
  • Memory 304 may include Random Access Memory (RAM), Read-Only Memory (ROM), or other types of memory.
  • Memory 304 illustrates an example of computer-readable storage media (devices) for storage of information such as computer-readable instructions, data structures, program modules or other data.
  • Memory 304 stores a basic input/output system (BIOS) 308 for controlling low-level operation of network computer 300 .
  • BIOS basic input/output system
  • the memory also stores an operating system 306 for controlling the operation of network computer 300 .
  • this component may include a general-purpose operating system such as a version of UNIX, or Linux®, or a specialized operating system such as Microsoft Corporation's Windows® operating system, or the Apple Corporation's OSX® operating system.
  • the operating system may include, or interface with one or more virtual machine modules, such as, a Java virtual machine module that enables control of hardware components or operating system operations via Java application programs.
  • other runtime environments may be included.
  • Memory 304 may further include one or more data storage 310 , which can be utilized by network computer 300 to store, among other things, applications 320 or other data.
  • data storage 310 may also be employed to store information that describes various capabilities of network computer 300 . The information may then be provided to another device or computer based on any of a variety of methods, including being sent as part of a header during a communication, sent upon request, or the like.
  • Data storage 310 may also be employed to store social networking information including address books, buddy lists, aliases, user profile information, or the like.
  • Data storage 310 may further include program code, data, algorithms, and the like, for use by a processor, such as processor 302 to execute and perform actions such as those actions described below.
  • Data storage 310 might also be stored on another component of network computer 300 , including, but not limited to, non-transitory media inside processor-readable removable storage device 336 , processor-readable stationary storage device 334 , or any other computer-readable storage device within network computer 300 , or even external to network computer 300 .
  • Data storage 310 may include, for example, data models 314 , display models 316 , source data 318 , or the like.
  • Data models 314 may store files, documents, versions, properties, meta-data, data structures, or the like, that represent one or more portions of one or more data models.
  • Display models 316 may store display models.
  • Source Data 318 may represent memory used for storing databases, or other data sources that contribute the data that underlies the data models, display models, or the like.
  • Applications 320 may include computer executable instructions which, when executed by network computer 300 , transmit, receive, or otherwise process messages (e.g., SMS, Multimedia Messaging Service (MMS), Instant Message (IM), email, or other messages), audio, video, and enable telecommunication with another user of another mobile computer.
  • Other examples of application programs include calendars, search programs, email client applications, IM applications, SMS applications, Voice Over Internet Protocol (VOIP) applications, contact managers, task managers, transcoders, database programs, word processing programs, security applications, spreadsheet programs, games, search programs, and so forth.
  • Applications 320 may include data management engine 322 , display engine 324 , lineage engine 326 , web services 329 , or the like, that may be arranged to perform actions for embodiments described below.
  • one or more of the applications may be implemented as modules or components of another application. Further, in one or more of the various embodiments, applications may be implemented as operating system extensions, modules, plugins, or the like.
  • data management engine 322 , display engine 324 , lineage engine 326 , web services 329 , or the like may be operative in a cloud-based computing environment.
  • these applications, and others, that comprise the management platform may be executing within virtual machines or virtual servers that may be managed in a cloud-based based computing environment.
  • the applications may flow from one physical network computer within the cloud-based environment to another depending on performance and scaling considerations automatically managed by the cloud computing environment.
  • virtual machines or virtual servers dedicated to data management engine 322 , display engine 324 , web services 329 , or the like may be provisioned and de-commissioned automatically.
  • data management engine 322 , display engine 324 , lineage engine 326 , web services 329 , or the like may be located in virtual servers running in a cloud-based computing environment rather than being tied to one or more specific physical network computers.
  • network computer 300 may also include hardware security module (HSM) 360 for providing additional tamper resistant safeguards for generating, storing or using security/cryptographic information such as, keys, digital certificates, passwords, passphrases, two-factor authentication information, or the like.
  • HSM hardware security module
  • hardware security module may be employ to support one or more standard public key infrastructures (PKI), and may be employed to generate, manage, or store keys pairs, or the like.
  • PKI public key infrastructure
  • HSM 360 may be a stand-alone network computer, in other cases, HSM 360 may be arranged as a hardware card that may be installed in a network computer.
  • network computer 300 may include an embedded logic hardware device instead of a CPU, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof.
  • the embedded logic hardware device may directly execute its embedded logic to perform actions.
  • the network computer may include one or more hardware microcontrollers instead of a CPU.
  • the one or more microcontrollers may directly execute their own embedded logic to perform actions and access their own internal memory and their own external Input and Output Interfaces (e.g., hardware pins or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.
  • SOC System On a Chip
  • FIG. 4 illustrates a logical architecture of system 400 for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • system 400 may include various components, such as, data model 402 , which may be comprised of various data objects ranging from one or more databases objects to one or more visualizations.
  • data model 402 includes database object 404 , database object 406 , table object 408 , table object 410 , table object 412 , workflow object 414 , data source object 416 , data source object 418 , workbook object 420 , sheet object 422 , and sheet object 424 .
  • visualization server computers such as, visualization server computer 116 may be arranged to employ data models, such as, data model 402 to represent information that may be used for generating visualizations.
  • data models may be used to manage other actors in a visualization system, including, users, authors, or the like.
  • data model 402 may have one or more root level data objects, such as, data object 404 and data object 406 .
  • Data object 404 and data object 406 represent databases that may be a source of information that drives the data model.
  • data object 404 may represent a SQL RDBMS associated with one part of an organization while data object 406 may represent an API gateway to another information provider or other databases.
  • data object 408 , data object 410 , data object 412 , or the like represent tables or table-like objects that may be provided by one or more databases.
  • the data objects may be considered to wrap or otherwise closely model the entities provided from the databases.
  • properties or attributes of table or database objects may closely mirror their native representations including attribute names, data types, table names, column names, or the like.
  • data administrators may be enabled to “import” databases or tables into a data model such that the imported objects retain some or all of the features or attributes that are available in native form.
  • one or more imported data objects may include metadata information that may be imported as well.
  • extract-transform-load (ETL) object 414 represents an ETL process that does some processing on information in table object 410 and table object 412 before it is made available for use in visualizations.
  • data source objects such as, data source 416 or data source 418 represent data objects that may be available for visualization authors to incorporate into visualizations or other display models.
  • data source objects may provide data administrators control to manage or otherwise shape the information from databases (e.g., database 404 or database 406 ) that may be made available to visualizations or visualization authors.
  • databases e.g., database 404 or database 406
  • tables in database 404 may include sensitive information that an organization want to exclude from visualizations.
  • mapping attributes from table objects to data source objects data administrators may control how data is exposed from the underlying databases.
  • data administrators may be enabled select particular columns or attributes from table objects to include in data sources.
  • attribute names in table objects may be mapped to different names in data sources.
  • a table column named customer identifier in a table object may be mapped to an attributed named ‘Account Number’ in the data source.
  • other transformations of mappings may be performed, such as, data type conversions, aggregations, filtering, combining, or the like.
  • extensive or complex transformations may be encapsulated in ETL objects, or the like, whereas simpler or more common transformations may be enabled without using a separate ETL object.
  • edge 448 represents a mapping from a table object to a data source.
  • edge 448 may represent the one or more data structures that map one or more attributes (e.g., columns) of table object 408 to data source 416 .
  • edge 448 provides or is associated one or more mapping rules or instructions that define which information from table object 408 is available in data source 416 , as well as, how the information from table object 408 may appear to visualization authors.
  • workbook object 420 represents a data object that may be associated with one or more user level data objects, such as, sheet object 422 or sheet object 424 .
  • visualization authors may be enabled to design workbooks, such as, workbook object 420 , based on information provided by one or more data sources, such as, data source 416 or data source 418 .
  • visualization authors may design workbooks that include one or more sheets (e.g., sheet object 422 or sheet object 424 .
  • sheet objects may include one or more visualizations, or the like.
  • sheet object 422 or sheet object 424 may represent some or all of the information that may be provided to a visualization engine, or the like, that provide one or more interactive visualization applications or reports that may be employed by users.
  • sheet object 422 or sheet object 424 may be considered to include or reference one or more of data, meta-data, data structures, or the like, that may be used to render one or more visualizations of information that may be provided by one or more databases.
  • sheets may be arranged to include one or more display models, styling information, text descriptions, narrative information, stylized graphics, links to other sheets, or the like.
  • FIG. 5 illustrates a logical schematic of data types 500 for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • data models may be comprised of various data objects of various data types.
  • one or more data types may be composed of one or more other data types.
  • data types may include database data type 502 , table data type 504 , column data type 506 , data source data type 508 , user data type 510 , field data type 512 , column field data type 514 , calculated field data type 516 , workbook data type 518 , sheet data type 520 , or the like.
  • each data type may include one or more attributes that one or more other data types or one or more references to other data types.
  • one or more attributes may include so-called built-in data types, such as, strings, integers, floating point numbers, or the like. For brevity and clarity built-in data types are omitted from this description.
  • various data types may be associated with a set of known behaviors or data constrains based on their definitions. Accordingly, in some embodiments, lineage engines may be arranged to programmatically interrogate data types to determine their compositions as well as rules or behavior associated.
  • schema models may further declare how some data types may be composed of other data types.
  • FIG. 6 illustrates a logical schematic of schema model 600 for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • scheme models such as, schema model 600 may declare how various data types in a visualization platform may be related to each other. Accordingly, in some embodiments, schema models may declare how data types may be composed of other data types.
  • schema models may represent relationships between data types using directed edges.
  • schema models may represent relationships between data types using two directed edges where a first directed edge may be considered to represent a relationship in one direction and a second directed edge may be considered to represent a relationship in the opposite direction. Accordingly, in one or more of the various embodiments, determining shortcuts between data type nodes in data model or schema model may require information that disambiguates the two relationships represented by each pair of directed edges.
  • table data type 604 may be composed of one or more columns, represented by column data type 606 and a reference to database data type 602 .
  • column data type 606 may be composed of one or more column field data types, represented by column field data type 608 .
  • data source data type 612 may be composed of one or more fields, represented by field data type 614 and a reference to user data type 610 .
  • calculated field data type 626 may be composed of one or more references to field data type 628 .
  • workbook data type 620 may be composed of one or more sheet data type 622 and a reference to user data type 616 .
  • sheet data type 622 may be composed of references to one or more fields illustrated by field data type 624 .
  • schema models may declare one or more shortcuts between one or more data types.
  • shortcuts may be considered relationships between data types that may enable more efficient queries.
  • shortcut 630 defines a shortcut from data source data types to database data types.
  • shortcut 632 defines a shortcut from workbook data types to database data types;
  • shortcut 634 defines a shortcut from table data types to data source data types;
  • shortcut 636 defines a shortcut from table data types to workbooks data types;
  • shortcut 638 defines a shortcut from column field data types to column data types; or the like. Note, in this example, shortcut 638 explicitly disambiguates the direction of the shortcut path from among a pair of reciprocal relationships between column data type 606 and column field data type 608 .
  • shortcuts may be considered part of the data types defined in schema models similar to other data types (attributes or references). Accordingly, in some embodiments, data designers that define schema models may include a definition of shortcuts to other data types. In some embodiments, shortcuts may be arranged to be data structures that include a specific directed path between the two data types that disambiguates between the direct or inverse relationships between the two data types. In contrast, in some conventional systems, data designers may be required to manually declare a fully-qualified path definition from two data types in the schema model to disambiguate between direct/inverse relationships included in the schema model.
  • shortcuts may be defined with explicit (fully qualified) paths.
  • explicit paths may be long and complex.
  • explicit shortcut paths may also required to be updated as well.
  • organizations/persons modifying one part of a schema model may be unaware of explicit shortcut paths that may be broken in other parts of the schema model.
  • lineage engines may be arranged to enable data designers to define shortcuts by providing hints/definitions that are easier to express correctly than fully qualified shortcut paths.
  • hints may include naming each endpoint of a shortcut rather than requiring users/data modelers to provide a fully qualified path between two data types.
  • the lineage engines may be arranged to automatically generate unambiguous directed paths through the schema model for the shortcuts.
  • data types with the same label may be considered the same data type.
  • field data type 614 , field data type 628 , field data type 624 , or the like may be considered as representing the same data type.
  • production schema models may include more or fewer data types that shown here.
  • FIG. 7 illustrates a logical schematic of closure 700 that may be a portion of a data model in accordance with one or more of the various embodiments.
  • lineage engines may be arranged to determine one or more portions of data models that may be considered closures as described below.
  • lineage engines may be arranged to execute one or more actions to determine one or more data types that may be classified together as closures.
  • a closure may one or more data structures that represent a portion of nodes and edges of a schema model that may be separated by a data flow boundary.
  • closures may be informally considered to be partitions of a schema model.
  • schema models may declare more than one closure.
  • closure 700 may be comprised of database data type 702 , table data type 704 and column data type 706 .
  • lineage engines may be arranged to employ schema models, data flow boundaries, closure hints, or the like, to determine closures for a schema model or data model.
  • FIG. 8 illustrates a representation of data structure 800 for representing data flow boundaries for schema models in accordance with one or more of the various embodiments.
  • data flow boundaries may be declared by users (e.g., data modelers, data designers, or the like) based on a corresponding data model or schema model.
  • lineage engines may be arranged to employ data flow boundaries to determine boundaries between closures in a schema model.
  • lineage engines may be arranged to traverse schema models to identify the data types that may be grouped into closures. Accordingly, in some embodiments, lineage engines may be arranged to employ data flow boundaries to help determine conditions for stopping traversals to determine closures.
  • data flow boundaries may be data structures with various fields, such as, source data type, target data type, edge identity, flow direction, or the like.
  • one or more data flow boundaries may be grouped into lists or arrays, such as, data flow boundary array 802 . Accordingly, in this example, for some embodiments, data flow boundary 804 represents a data structure for declaring a data flow boundary.
  • data flow boundary 804 may include one or more fields, such as, source data type 806 , edge identity 808 , target data type 810 , flow direction 812 , or the like.
  • data flow boundary 804 declares a data flow boundary between column data types and column field data types along an edge identified as referencedByFields.
  • lineage engines may be arranged to employ data flow boundary 804 to determine that column fields should not be included in the same closure as columns.
  • other data flow boundaries in data flow boundary array 802 may define other data flow boundaries in the data model that may contribute to determining closures.
  • the edge declared for a data flow boundary may delineate that separation or boundary in schema model between closures.
  • edge identity 808 declares the edge that represents the boundary.
  • data structure 800 may be represented using various implementations, such as, JSON (as shown), XML, structures, objects, database tables, or the like, without departing from the scope of these innovations.
  • data flow boundaries may be defined as part of data type definitions in other parts of data models rather than being separate data structures as shown here.
  • FIG. 9 illustrates a representation of data structure 900 for representing closure hints for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • closure hints may be declared by users (e.g., data modelers, data designers, or the like) based on a corresponding data model.
  • lineage engines may be arranged to employ closure hints to determine closures for data models.
  • lineage engines may be arranged to traverse data models to identify the data types that may be grouped into closures. Accordingly, in some embodiments, lineage engines may be arranged to employ closure hint to help determine conditions for including data types into closures.
  • closure hints may be data structures with various fields, such as, source data type, target data type, edge identity, flow direction(s), or the like.
  • closure hint 904 represents a data structure for declaring a closure hint.
  • closure hint 904 may include one or more fields, such as, source data type 906 , edge identity 908 , target data type 910 , flow directions 912 , or the like.
  • closure hint 904 declares a closure hint between column data types and table data types along an edge identified as ‘table’.
  • lineage engines may be arranged to employ closure hint 904 to determine the closures that may be employed for generating shortcut paths between related data types.
  • data structure 900 may be implements using various representations, such as, JSON (as shown), XML, structures, objects, database tables, or the like, without departing from the scope of these innovations.
  • closure hints may be defined as part of data type definitions in other parts of data models rather than being separate data structures as shown here.
  • FIGS. 10 - 16 represent generalized operations for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • processes 1000 , 1100 , 1200 , 1300 , 1400 , 1500 , and 1600 described in conjunction with FIGS. 10 - 16 may be implemented by or executed by one or more processors on a single network computer, such as network computer 300 of FIG. 3 .
  • these processes, or portions thereof may be implemented by or executed on a plurality of network computers, such as network computer 300 of FIG. 3 .
  • these processes, or portions thereof may be implemented by or executed on one or more virtualized computers, such as, those in a cloud-based environment.
  • embodiments are not so limited and various combinations of network computers, client computers, or the like may be utilized.
  • the processes described in conjunction with FIGS. 10 - 15 may be used for generating shortcut paths between related data types in accordance with at least one of the various embodiments or architectures such as those described in conjunction with FIGS. 4 - 9 .
  • some or all of the actions performed by processes 1000 , 1100 , 1200 , 1300 , 1400 , 1500 , and 1600 may be executed in part by data management engine 322 , display engine 324 , or lineage engine 326 running on one or more processors of one or more network computers.
  • FIG. 10 illustrates an overview flowchart of process 1000 for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • a data model may be provided to a lineage engine.
  • a data management engine, display engine, or the like may be arranged to generate data models that may be used by visualization authors. data modelers, or data administrators to create data objects that may be associated with various data model layers or data types in the data model.
  • one or more shortcut definitions may be provided to the lineage engine.
  • shortcut definitions may be declared by users, data modelers, data administrators. or the like. Often, shortcut definitions may be included in data model if new data types are introduced into a data model. In some embodiments, shortcut definitions may be provided to declare directed paths between one of more pairs of data types in the data model. Accordingly, in some embodiments, shortcut definitions may include at least a source data type, target data type, and a flow direction (e.g., up, or down).
  • a data model may be an undirected graph or partially undirected graph such that naive traversals of the data model may provide ambiguous or incorrect results absent the application of innovations disclosed herein.
  • data models may declare a pair of relationships between one or more of the data types—one in each direction.
  • paired directed edges may represent different ‘directions’, determining shortcut paths by observation may provide incorrect or ambiguous path results because it may not be clear from observation which direction the shortcut path should take through the data model.
  • shortcut definitions may be provided if relationships of existing data types in a data model may be modified.
  • shortcut definitions may be arranged to enable users to provide a minimum amount of information.
  • an important feature of shortcut definitions is to enable users to unambiguously define a relationship between source data types and target data types without concern for intervening data types in the data model.
  • a shortcut declared for data type A to data type F may produce a directed path of A->B->C->D->E->F that may be provided to traverse between data types in the data model.
  • the shortcut definition may remain valid even when the shortcut directed path becomes A->B->E->C->D->F because of changes in the data model.
  • changes to a data model may break or invalidate shortcut directed paths that are explicitly declared.
  • the lineage engine may be arranged to determine one or more closures in the data model.
  • lineage engines in preparation for generating shortcut paths from shortcut definitions, lineage engines may be arranged to evaluate the data model to determine/identify one or more closures that may be in the data model.
  • closures may be defined as portions/partitions of the data model that satisfy various specific conditions.
  • closures may be considered to be groups of related data types that fit within declared data flow boundaries.
  • determining the data types that may be grouped into closures depends on the data flow boundaries that may be declared for a data model.
  • data flow boundaries may be defined by declaring a flow source data type, flow target data type, and flow direction. Accordingly, in some embodiments, the ‘boundary’ is between the source data type and the target data type in a defined traversal direction (flow direction).
  • the selection of where to define data flow boundaries depends on the local requirements of the user, data modelers, or the like, who may be authoring or using the data model. Accordingly, in one or more of the various embodiments, closure hints may be declared by users, data modelers, data administrators, or the like. (See, FIG. 8 , above)
  • lineage engines may be arranged to execute one or more actions to group data types into closures.
  • a given data type may be included in more than one closure.
  • lineage engines may be arranged to generate closures at an initialization time (e.g., upon launch of the lineage engines or visualization platform, or the like) or, in some cases, closure generation may be deferred until a first query associated with a shortcut may be provided. Accordingly, in some embodiments, lineage engines may be arranged to employ rules, instructions, or the like, provided via configuration information to determine if closures should be generated.
  • lineage engines may be arranged to keep the closure data structures in memory or in cache for a designated duration, such as, length of current session, while the lineage engine in running, timeout, or the like.
  • lineage engines may be arranged to employ rule, instructions, or the like, provided via configuration information to determine the lifetime of one or more closure data structures.
  • the lineage engine may be arranged to generate one or more shortcut directed paths based on the one or more closures and the one or more shortcut definitions.
  • lineage engines may be arranged to generate the fully qualified shortcut directed paths for each declared shortcut.
  • the shortcut directed path enables lineage engines, or the like, to correctly traverse data type relationship in data model as needed.
  • the lineage engine may be arranged to employ the generated shortcut directed paths provide responses to one or more queries associated with the data model.
  • lineage engines may be arranged to enable other applications, services, clients, or the like, to provide queries associated with the relationships in the data model. Accordingly, in some embodiments, shortcut directed paths generated for shortcuts may be employed to provide correct responses. In some embodiments, absent shortcut directed paths, some traversal paths or other relationships may be ambiguous or indeterminable.
  • control may be returned to a calling process.
  • FIG. 11 illustrates a flowchart of process 1100 for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • a data model may be provided to a lineage engine.
  • data model definitions may be authored by users, such as, data modelers, data designers, administrators, application developers, or the like.
  • data model definitions may include one or more data types that may be composed of one or more other data types.
  • one or more closure hints may be proved to the lineage engine.
  • data model definitions may include one or more closure hints or closure definitions.
  • closures may be groups of data types that are grouped together to meet local requirements or local circumstances.
  • the specific closure hints for a data model may be declared by users.
  • closure hints may be provided by configuration information that define the data model.
  • closure hints may be provided in files or data structures that may be separate from the information used to define data models.
  • closure hints reference data types (source data type and target data type), relationships (edges), and flow directions (up/down) that may be interpreted by lineage engines to generate closures.
  • one or more data flow boundaries may be provided to the lineage engine.
  • data model definitions may include one or more data flow boundaries definitions.
  • data flow boundaries may be boundaries between data types that are declared to meet local requirements or local circumstances.
  • the specific data flow boundaries for a data model may be declared by users.
  • data flow boundaries may be provided by configuration information that define the data model.
  • data flow boundaries may be provided in files or data structures that may be separate from the information used to define data models.
  • data flow boundaries reference data types (source data type and target data type), relationships (edges), and flow directions (up/down) that may be interpreted by lineage engines to generate data flow boundaries.
  • the lineage engine may be arranged to determine one or more closures to generate for generating shortcut paths between related data types.
  • lineage engines may be arranged to generate one or more closures based on the closure hints.
  • lineage engines may be arranged to generate a number of closures as provided by the closure hints.
  • closures may be up closures or down closures.
  • up closures may be closures generated from the point of view or starting point of a data type that is considered to be below or downstream in the data model other members of the same closure.
  • lineage engines may be arranged to determine if a closure may be an up closure or a down closure from the closure hint associated with the closure being generated.
  • down closures may be closures generated from the point of view or starting point of a data type that is considered to be above or upstream in the data model from other members of the same closure.
  • up closures or down closure may be distinguishable because they may require different actions to generate.
  • the lineage engine may be arranged to generate an up closure.
  • lineage engines may be arranged to execute one or more actions to generate up closures as described below in more detail.
  • the lineage engine may be arranged to generate a down closure.
  • lineage engines may be arranged to execute one or more actions to generate down closures as described below in more detail.
  • control may loop back to block 1108 ; otherwise, control may flow to block 1118 .
  • lineage engines may be arranged to continue to generate closures until at least one closure for each closure hint has been generated.
  • a closure hint may declare that both an up closure and a down closure should be generated for the same data types.
  • the lineage engine may be arranged to employ the one or more closures to generate shortcut directed paths.
  • control may be returned to a calling process.
  • FIG. 12 illustrates a flowchart of process 1200 for generating closures for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • a source data type and target data type of for a shortcut path may be provided to a lineage engine.
  • lineage engines may be provided one or more shortcut declarations or shortcut definitions as part of (or along with) a data model definition.
  • each shortcut definition may identify a source data type and a target data type.
  • shortcut declarations may be provided using JSON, XML, text, or the like.
  • lineage engines may be arranged to parse shortcut declarations to determine the source data type and a target data type.
  • the source data type and target data type may be considered the endpoints of the shortcut while the lineage engines may be arranged to determine intervening data types that comprise a shortcut directed path from the source data type to the target data type.
  • the lineage engine may be arranged to determine one or more candidate nodes based the ‘up’ closures for the source data type.
  • nodes in the data model may be considered to correspond to data types.
  • relationships between data types may be represent by edges that connect the nodes that represent the data types in the data model.
  • the nodes included in the up closures may be added to a pool of candidate nodes that may be further evaluated to determine the shortcut path between the source data type and target data type.
  • the lineage engine may be arranged to determine one or more traversal edges based on the one or more candidate nodes. Similar collecting the candidate nodes based on the up closures associated with the source data type, the edges associated with the up closures may be collected into a pool of traversal edges that may be evaluated to determine the shortcut paths.
  • the lineage engine may be arranged to generate a tree based on the initial candidate nodes and the one or more traversal edges.
  • lineage engines may be arranged to traverse the candidate edges to generate a tree based on the candidate nodes and the traversal edges.
  • the tree may include one or more duplicate nodes that may represent the same data type and one or more edges that represent the same relationship.
  • the lineage engine may be arranged to remove one or more branches of the tree that lead to leaves the are not the target data type.
  • the generated tree may include one or more leaf nodes. Accordingly, in some embodiments, leaf nodes that may represent data types different from the target data type may be determined.
  • lineage engines may be arranged to identify and discard branches in the tree that are associated with leaf nodes that correspond to data types different from the target data type.
  • the lineage engine may be arranged to remove one or more duplicate edges that may be in the tree.
  • lineage engines may be arranged to identify duplicate edges and remove them from the tree.
  • the lineage engine may be arranged to generate a shortcut directed path based on the resulting tree.
  • the modified tree may comprise of a root node that corresponds to the source data type and the remaining leaf node may correspond to the target data type. Accordingly, in some embodiments, the remaining nodes and edges comprise the shortcut directed path from the source data type to the target data type.
  • control may be returned to a calling process.
  • FIG. 13 illustrates a flowchart of process 1300 for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • lineage engines may be arranged to provide the one or more candidate nodes based on the closures associated with the source data type and target data type. (See, block 1204 in process 1200 , FIG. 12 ).
  • the lineage engine may be arranged to add data flow boundary ‘down’ edges to the traversal set.
  • lineage engines may be arranged to employ the information included in the data flow boundaries to determine one or more edges to include in the edge traversal pool.
  • data flow boundary declarations include an edge definition associated with the data flow boundary.
  • lineage engines may be arranged to evaluate the candidate nodes and their associated edges to determine if there may be one or more flow boundaries.
  • the one or more edges that demark flow boundaries may be declared in the data flow boundary definitions included with the data model.
  • the edges included in the determined flow boundaries may be added to a set edges that may require traversal. For example, if a shortcut may be defined that may cross a flow boundary, those determined edges that make up the flow boundary may be traversed if searching for shortcut path.
  • the lineage engine may be arranged to traverse the data model.
  • lineage engines may be arranged to visit the nodes in the candidate node pool and traverse the edges in the traversal edge pool.
  • the candidate nodes and traversal edges may be assembled into a tree-like graph with nodes corresponding to data types and edges corresponding to relationships between or among the candidate nodes.
  • lineage engines may be arranged to traverse each edge.
  • one or more edges may be added to the traversal set.
  • lineage engines may be arranged to begin the traversal at the source data type determined from the shortcut declarations included with the data model. Accordingly, in some embodiments, lineage engines may be arranged to track the distance that the currently visited node may be from the starting node.
  • the lineage engine may be arranged to add ‘down’ closure edges to edge traversal set.
  • closure information included in or with data model includes flow direction indicators for the defined closures to identify which of the two edges (e.g., edges in opposite direction) should be considered. Accordingly, in one or more of the various embodiments, the edges included in the ‘down’ closures associated with the visited node may be added to the traversal set.
  • control may jump to block 1314 ; otherwise, control may loop back to block 1306 .
  • lineage engines may be arranged to track if edges in the traversal set have been traversed.
  • lineage engines may be arranged to add the nodes associated with traversed edges to an intermediate tree-like graph. Also, in some embodiments, lineage engines may be arranged to add the traversed edge to the intermediate tree.
  • the lineage engine may be arranged to provide the intermediate tree.
  • lineage engines may be arranged to include duplicate data types or duplicate relationships in the intermediate tree depending on the data model.
  • the intermediate trees may be considered tree-like graphs rather than formal trees because they may not conform to formal definitions of tree graphs.
  • lineage engines may be arranged to perform additional operations as described above to prune/clean the intermediate tree to determine the requested shortcut directed path.
  • control may be returned to a calling process.
  • FIG. 14 illustrates a flowchart of process 1400 for generating closures for generating shortcut paths between related data types in accordance with one or more of the various embodiments.
  • lineage engines may be arranged to provide a closure hint from the data model.
  • one or more closure hints may be included or associated with a data model.
  • closure hints declare that the lineage engine should generate a closure that includes the source data type and the target data type. Additional data types may be included depending on topography of the data model.
  • closure hints include indicators if the closure may be an up closure or a down closure.
  • a closure hint may indicate that both up closures and down closures should be generated for a given source/target pair of data types.
  • the edges directed away from the source data type on a path towards to the target data type may be considered to be edges in the down direction.
  • the edges directed away from the target data type to the source data type may be considered to be edges in the up direction.
  • the lineage engine may be arranged to determine a source data type from the closure hint that may be provided with the data model.
  • a particular data type may be a source data type for more than one closure.
  • the lineage engine may be arranged to determine a target data type from the closure hint that may be provided with the data model.
  • a particular data type may be a target data type for more than one closure.
  • the lineage engine may be arranged to traverse the data model from the closure source data type to the closure target data type.
  • closure hints may include at least one named relationship that indicate an edge in the data model that may link to the source data type with the target data type.
  • the lineage engine may be arranged to generate a closure that corresponds to the closure hint.
  • the closure may include at least two data types, the source data type and the target data type. However, in some embodiments, if the source data type or the target data type may be composed of additional data types, those data types may be included in the closure as well. For example, if Table data type 704 in closure 700 included additional data types representing attributes or features of the table data type, those data types may be included in the closure.
  • control may loop back to block 1402 ; otherwise, control may be returned to a calling process.
  • data models may be configured to include one or more closure hints.
  • lineage engines may be arranged to process each closure hint to generate the closures for a data model.
  • FIG. 15 illustrates a flowchart of process 1500 for processing queries based on shortcut paths between related data types in accordance with one or more of the various embodiments.
  • the lineage engine may be arranged to generate one or more run-time shortcut paths. Accordingly, in some embodiments, lineage engines may be arranged to generate one or more shortcut directed paths from the shortcut declarations associated with the data model.
  • lineage engines may be arranged to cache generated shortcut paths to enable their reuse during active sessions.
  • lineage engines may be arranged to provide APIs that enable query providers to request if a shortcut directed path should be cached or discarded after use.
  • lineage engines may be arranged to determine if shortcut directed paths should be cached based on timeout values, priority levels, or the like, that may be associated with shortcuts or queries.
  • the lineage engine may be arranged to determine one or more persisted shortcuts.
  • data models may declare that one or more shortcuts may be persisted shortcuts.
  • persisted shortcuts may be generated as described above during an initialization stage and then stored for later use.
  • one or more persistent shortcuts may be manually generated or otherwise hand-tuned by data designers. Accordingly, in some embodiments, persistent shortcuts may represent optimal or preferred paths. In some embodiments, persisted shortcuts may be included in the data model as an edge that may be traversed the same as other edges in the data model. In some embodiments, persisted shortcuts may provide direct (one-hop) relationships that may replace paths that include multiple hops.
  • relevant persisted shortcuts may include persisted shortcuts that may be related to portions of the data model that may be associated with data objects or data types that may be match the data types included in one or more runtime shortcut paths.
  • the lineage engine may replace the shortcut path with the persisted shortcut.
  • lineage engines may be arranged to replace the longest qualifying runtime shortcut or runtime shortcut path portion with the persistent shortcut. Accordingly, in some cases, multi-hop paths comprising multiple nodes or edges may be replaced by a single edge represented by the persistent shortcut. Thus, in some embodiments, compute performance or memory consumption for query resolution may be reduced by reducing the number of nodes or edges that may be traversed to resolve the query.
  • the lineage engine may be arranged to substitute the one or more persisted shortcuts into the shortcut directed paths.
  • lineage engines may be arranged to replace portions of shortcuts paths with persisted shortcut paths.
  • a generated shortcut directed path may be A->B->C->D->E (where A-E are data types) and persisted shortcut Q has a source data type of B and a target data type of D
  • persisted shortcut Q may be substituted into the shortcut as so A->[Q]->E.
  • the lineage engine may be arranged to employ the shortcut directed paths to resolve subsequent queries.
  • control may be returned to a calling process.
  • FIG. 16 illustrates a flowchart of process 1600 for processing queries based on shortcut paths between related data types in accordance with one or more of the various embodiments.
  • query information may be provided to a lineage engine.
  • the data models provided or managed by lineage engines may be employed by one or more other applications, such as, visualization platforms, or the like.
  • the data objects and data types included in data models may be employed in user interfaces, visualizations, or the like. Accordingly, in some embodiments, such applications or services may provide one or more queries to retrieve data objects or other information about the data models.
  • an application may request information about a data source that provides one or more fields that are displayed in a user interface or visualization.
  • lineage engines may be arranged to provide user interfaces that enable similar queries to support data administration or data management of data models.
  • lineage engines may be arranged to parse various query types in various languages or representations.
  • lineage engines may be arranged to support queries expressed using a variety of query languages, such as, SQL-like query languages, graph-based query languages, or object-based query languages.
  • lineage engines may be arranged to employ parses, rules, grammars, or the like, provided via configuration information to include/extend the supported query languages.
  • lineage engines may be arranged to provide one or more APIs that enable authorized users, applications, or services to provide query information requesting information about particular data objects or data types.
  • query information may be provided in JSON, XML, text, API parameters, or the like, or combination thereof.
  • the lineage engine may be arranged to determine one or more shortcut directed paths that were generated previously based on the data model.
  • the lineage engine may be arranged to employ the one or more shortcut directed paths to resolve the query.
  • lineage engines may be arranged to parse the query information to identify if it references data objects or data types that may be associated with one or more of the directed shortcut paths.
  • lineage engines may be arranged to employ shortcut directed paths to correctly determine query responses related to the data types in data model.
  • control may be returned to a calling process.
  • each block in each flowchart illustration, and combinations of blocks in each flowchart illustration can be implemented by computer program instructions.
  • These program instructions may be provided to a processor to produce a machine, such that the instructions, which execute on the processor, create means for implementing the actions specified in each flowchart block or blocks.
  • the computer program instructions may be executed by a processor to cause a series of operational steps to be performed by the processor to produce a computer-implemented process such that the instructions, which execute on the processor, provide steps for implementing the actions specified in each flowchart block or blocks.
  • the computer program instructions may also cause at least some of the operational steps shown in the blocks of each flowchart to be performed in parallel.
  • each block in each flowchart illustration supports combinations of means for performing the specified actions, combinations of steps for performing the specified actions and program instruction means for performing the specified actions. It will also be understood that each block in each flowchart illustration, and combinations of blocks in each flowchart illustration, can be implemented by special purpose hardware based systems, which perform the specified actions or steps, or combinations of special purpose hardware and computer instructions.
  • special purpose hardware based systems which perform the specified actions or steps, or combinations of special purpose hardware and computer instructions.
  • the logic in the illustrative flowcharts may be executed using an embedded logic hardware device instead of a CPU, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof.
  • the embedded logic hardware device may directly execute its embedded logic to perform actions.
  • a microcontroller may be arranged to directly execute its own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.
  • SOC System On a Chip

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • Software Systems (AREA)
  • Mathematical Physics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • User Interface Of Digital Computer (AREA)
  • Stored Programmes (AREA)
US17/409,299 2021-08-23 2021-08-23 Generating shortcut paths between related data types Abandoned US20230059083A1 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
US17/409,299 US20230059083A1 (en) 2021-08-23 2021-08-23 Generating shortcut paths between related data types
PCT/US2022/038328 WO2023027851A1 (en) 2021-08-23 2022-07-26 Generating shortcut paths between related data types
JP2024512102A JP2024536692A (ja) 2021-08-23 2022-07-26 関連するデータ型間のショートカットパスの生成
CN202280061654.8A CN117999549A (zh) 2021-08-23 2022-07-26 生成相关数据类型之间的捷径路径
EP22761669.5A EP4392872A1 (en) 2021-08-23 2022-07-26 Generating shortcut paths between related data types
US18/540,844 US20240111791A1 (en) 2021-08-23 2023-12-14 Generating shortcut paths between related objects

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US17/409,299 US20230059083A1 (en) 2021-08-23 2021-08-23 Generating shortcut paths between related data types

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/540,844 Continuation US20240111791A1 (en) 2021-08-23 2023-12-14 Generating shortcut paths between related objects

Publications (1)

Publication Number Publication Date
US20230059083A1 true US20230059083A1 (en) 2023-02-23

Family

ID=83149327

Family Applications (2)

Application Number Title Priority Date Filing Date
US17/409,299 Abandoned US20230059083A1 (en) 2021-08-23 2021-08-23 Generating shortcut paths between related data types
US18/540,844 Pending US20240111791A1 (en) 2021-08-23 2023-12-14 Generating shortcut paths between related objects

Family Applications After (1)

Application Number Title Priority Date Filing Date
US18/540,844 Pending US20240111791A1 (en) 2021-08-23 2023-12-14 Generating shortcut paths between related objects

Country Status (5)

Country Link
US (2) US20230059083A1 (zh)
EP (1) EP4392872A1 (zh)
JP (1) JP2024536692A (zh)
CN (1) CN117999549A (zh)
WO (1) WO2023027851A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117331933A (zh) * 2023-09-11 2024-01-02 安徽省大数据中心 基于多源异构统一纳管的安全运营方法及系统
CN117591705A (zh) * 2024-01-19 2024-02-23 北京志翔科技股份有限公司 基于图搜索的分表关联方法及设备

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10698955B1 (en) * 2016-07-19 2020-06-30 Datastax, Inc. Weighted abstract path graph database partitioning
US20220113150A1 (en) * 2020-10-12 2022-04-14 Verizon Patent And Licensing Inc. Systems and methods for optimal path determination using contraction hierarchies with turn costs

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11194845B2 (en) * 2019-04-19 2021-12-07 Tableau Software, LLC Interactive lineage analyzer for data assets

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10698955B1 (en) * 2016-07-19 2020-06-30 Datastax, Inc. Weighted abstract path graph database partitioning
US20220113150A1 (en) * 2020-10-12 2022-04-14 Verizon Patent And Licensing Inc. Systems and methods for optimal path determination using contraction hierarchies with turn costs

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Bauer et al., "The Shortcut Problem – Complexity and Algorithms", 2012 (Year: 2012) *
Hesse, "Directed Graphs Requiring Large Numbers of Shortcuts", 2002 (Year: 2002) *
Polyviou et al., "Query by Browsing: A Visual Query Language Based on the Relational Model and the Desktop User Interface Paradigm, 2001 (Year: 2001) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117331933A (zh) * 2023-09-11 2024-01-02 安徽省大数据中心 基于多源异构统一纳管的安全运营方法及系统
CN117591705A (zh) * 2024-01-19 2024-02-23 北京志翔科技股份有限公司 基于图搜索的分表关联方法及设备

Also Published As

Publication number Publication date
CN117999549A (zh) 2024-05-07
WO2023027851A1 (en) 2023-03-02
US20240111791A1 (en) 2024-04-04
JP2024536692A (ja) 2024-10-08
EP4392872A1 (en) 2024-07-03

Similar Documents

Publication Publication Date Title
US11687571B2 (en) Interactive lineage analyzer for data assets
US11605189B2 (en) Dynamic visualization and data analytics based on parameter actions
US20240111791A1 (en) Generating shortcut paths between related objects
US11651003B2 (en) Interactive data visualization interface for data and graph models
US11397746B2 (en) Interactive interface for data analysis and report generation
US11853258B2 (en) Aggregating metrics in distributed file systems
US20240095285A1 (en) Dynamic graph generation for interactive data analysis
US11579760B2 (en) Automatic data model generation
US20210117487A1 (en) Conditional filters with applications to join processing
US20220382761A1 (en) Metadata inheritance for data assets
US20210133239A1 (en) Providing data visualizations based on personalized recommendations
US12105742B2 (en) Providing data flow directions for data objects
US20240289348A1 (en) Parenting computed fields with data objects
US11537490B2 (en) Event sequence analysis
US20240257027A1 (en) Determining shortcut relationships in data models
US20230008999A1 (en) Data processing for visualizing hierarchical data
WO2022256235A1 (en) Metadata inheritance for data assets

Legal Events

Date Code Title Description
AS Assignment

Owner name: TABLEAU SOFTWARE, LLC, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VERMA, HARSH;CASTURI, RAMAKRISHNA;DOYLE, TYLER JAMES-BUKER;AND OTHERS;SIGNING DATES FROM 20210820 TO 20210821;REEL/FRAME:057260/0146

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: AWAITING TC RESP., ISSUE FEE NOT PAID

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO PAY ISSUE FEE