Graphs Patents (Class 707/798)
  • Publication number: 20150066989
    Abstract: Data specifying a new edge of a graph database may be received. A data store for storing the new edge may be identified from amongst a plurality of data stores utilized to store one or more portions of the graph database. Each of the plurality of data stores may be associated with a set of values corresponding to an aspect of edges of the graph database. The data store for storing the new edge may be identified based on the new edge being associated with a value corresponding to the aspect of edges of the graph database that is within a set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge.
    Type: Application
    Filed: August 28, 2013
    Publication date: March 5, 2015
    Applicant: Bank of America Corporation
    Inventor: Sounil Yu
  • Publication number: 20150066990
    Abstract: Systems and methods for identifying entities sharing a temporal pattern using bipartite graphs are described. In one embodiment, a method includes identifying a temporal pattern in a sequence of bipartite graphs for a sequence of records involving two entity types, where records of the sequence of bipartite graphs vary according to time. An embodiment may color code the edges between entity types in the sequence of bipartite graphs according to the at least one temporal pattern identified (e.g., increasing sales between a business representative and a customer). An embodiment may therefore identify a time-based relationship between at least two entities according to the coded edges. Given the identification of entities having a time-based relationships, groups of these entities may be identified and trends may be derived therefrom (e.g., increasing sales for business units of a particular geographic region).
    Type: Application
    Filed: September 3, 2013
    Publication date: March 5, 2015
    Applicant: International Business Machines Corporation
    Inventors: Manoj Kumar Agarwal, Sumit Negi, L. Venkata Subramaniam, Oliver Markus Vogel
  • Publication number: 20150066991
    Abstract: An apparatus, and corresponding method, for generating a graph used in performing a search for a match of at least one expression in an input stream is presented. The graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc may also include a nodal bit map including structural information of a node to which the valid arc points to. A walker process may utilize the nodal bit map to determine if a memory access is necessary. The nodal bit map reduces the number of external memory access and therefore reduces system run time.
    Type: Application
    Filed: October 17, 2014
    Publication date: March 5, 2015
    Inventor: Rajan Goyal
  • Patent number: 8972356
    Abstract: A data integration processing device configured to integrate a plurality of graphs includes: an integration processing method selecting means 4 for selecting an integration processing method used for integration of inputted graphs; and an integration process executing means 6, having a plurality of integration processing methods, for integrating a plurality of graphs by executing an integration process in accordance with an integration processing method selected by the integration processing method selecting means 4 from among the plurality of integration processing methods. The integration processing method selecting means 4, with respect to each of nodes in inputted graphs, selects an integration processing method used for integrating lower nodes in accordance with frequency that the lower nodes are consistent, when upper nodes are consistent.
    Type: Grant
    Filed: September 13, 2011
    Date of Patent: March 3, 2015
    Assignee: NEC Corporation
    Inventor: Takeshi Arikuma
  • Patent number: 8965934
    Abstract: A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.
    Type: Grant
    Filed: November 16, 2011
    Date of Patent: February 24, 2015
    Assignee: Quova, Inc.
    Inventor: Armand Erik Prieditis
  • Publication number: 20150052175
    Abstract: A system for identifying a schema for storing graph data includes a database containing a graph dataset of data and relationships between data pairs and a list of storage methods that each are a distinct structural arrangement of the data and relationships from the graph data set. An analyzer module collects statistics for the graph dataset, and a data classification module uses the collected statistics to calculate metrics describing the data and relationships in the graph dataset, uses the calculated metrics to group the data and relationships into a plurality of graph dataset subsets and. associates each graph dataset subset with one of the plurality of storage methods. The resulting group of storage methods associated with the plurality of graph dataset subsets includes a unique storage method for each graph dataset subset. The data and relationships in each graph dataset subset are arranged in accordance with associated storage methods.
    Type: Application
    Filed: August 14, 2013
    Publication date: February 19, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mihaela Ancuta Bornea, Julian Timothy Dolby, Achille Belly Fokoue-Nkoutche, Anastasios Kementsietsidis, Kavitha Srinivas
  • Patent number: 8959119
    Abstract: A context-based graph-relational intersect derived (CB-GRID) links a real entity graph node to a synthetic entity graph node. The real entity graph node comprises a pointer to a primary key in a first tuple that non-contextually describes the real entity. A primary relational database comprises the first tuple that non-contextually describes the real entity. A context relational database comprises a second tuple that contains a foreign key that matches the primary key in the primary relational database. The second tuple dynamically describes a context of data in the first tuple. A contextual entity relational database comprises a third tuple that contains data from the first tuple and the second tuple. The synthetic entity graph node describes a synthetic entity that is described by data in the third tuple, such that the contextual entity relational database links the real entity graph node to the synthetic entity graph node.
    Type: Grant
    Filed: August 27, 2012
    Date of Patent: February 17, 2015
    Assignee: International Business Machines Corporation
    Inventors: Samuel S. Adams, Robert R. Friedlander, John K. Gerken, III, James R. Kraemer
  • Publication number: 20150046496
    Abstract: In one exemplary embodiment, a computer-implemented method of generating an implicit social graph includes receiving an eye-tracking data associated with a word. The eye-tracking data is received from a user device. The word is a portion of a digital document. The eye-tracking data comprises at least one fixation period of substantially seven-hundred and fifty milliseconds and at least one regression from another portion of the digital document to the word. A comprehension difficulty of the word is determined based on the eye-tracking data. One or more attributes to a user of the user device is assigned, by one or more processors based on the comprehension difficulty, wherein the one or more attributes are determined based on a meaning of the word. An implicit social graph is generated based on the one or more attributes.
    Type: Application
    Filed: August 9, 2013
    Publication date: February 12, 2015
    Inventors: Amit V. Karmarkar, Richard R. Peters
  • Patent number: 8954475
    Abstract: Techniques are described herein that are capable of deep cloning (a.k.a. deep copying) objects using a binary format. A deep clone of a designated object includes references to other objects (and potentially copies of the other objects) included in the designated object. A binary representation of each object in an object graph is generated to provide a binary clone of the object graph. Objects created by a dynamic language engine are called dynamic language objects. Objects created by a host (e.g., that hosts the dynamic language engine) are called host objects. Each host object is associated with an intermediate representation thereof via a property bag that describes properties of that host object. Each intermediate representation is understandable by the dynamic language engine. A binary representation of each dynamic language object and each host object may be generated in accordance with the binary format to provide the binary clone.
    Type: Grant
    Filed: November 10, 2011
    Date of Patent: February 10, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Gaurav Seth, Jianchun Xu, Koundinya Veluri, Geoffrey M. Kizer
  • Publication number: 20150032777
    Abstract: The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas.
    Type: Application
    Filed: July 23, 2013
    Publication date: January 29, 2015
    Applicant: SAP AG
    Inventors: Michael Dietrich, Jens Lemcke, Gunther Stuhec
  • Patent number: 8943068
    Abstract: A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.
    Type: Grant
    Filed: February 26, 2013
    Date of Patent: January 27, 2015
    Assignee: Cray Inc
    Inventor: David Mizell
  • Patent number: 8943084
    Abstract: To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints.
    Type: Grant
    Filed: May 17, 2012
    Date of Patent: January 27, 2015
    Assignee: International Business Machines Corporation
    Inventors: Futoshi Iwama, Hisashi Miyashita, Hideki Tai
  • Publication number: 20150026217
    Abstract: A data output method includes: generating, by a computer, (n?1) first conditions (n is an integer number of three or more) on a relationship between two data by dividing, in a sequential order, a common element condition in which an attribute of each of n data includes a common element, the attribute of each of the two data including the common element; extracting first data corresponding to each of n data to set the first data as a node under a condition; creating a first graph in which nodes are coupled with links based on the first condition; creating a second graph by repeatedly performing a first process, a second process and a third process; determining candidates of a combination of data from the second graph; and outputting a combination of data satisfying the common element condition from the candidates of a combination of data.
    Type: Application
    Filed: June 19, 2014
    Publication date: January 22, 2015
    Inventors: TAKASHI KATOH, Shinichiro Tago, Tatsuya Asai, Hiroaki Morikawa, Junichi Shigezumi, Hiroya Inakoshi
  • Patent number: 8938220
    Abstract: A system for automatic selection and presentation of pertinent contacts having a mobile communication device, a plurality of information sources and an application operating based on a method of automatic selection and presentation of pertinent contacts. When a user attempts to establish a connection with a person, the method provides a prioritized list of suggested pertinent contacts that the user is likely to want to call. The method combines information from the plurality of information sources to suggest a plurality of appropriate contacts to be contacted. The application analyses a multitude of information including current context, calendar information, past call history, information from social network/social networking application, current time, location, any information from the navigational tool running on the mobile communication device, publicly available information etc to suggest a plurality of appropriate contacts to the user.
    Type: Grant
    Filed: July 3, 2012
    Date of Patent: January 20, 2015
    Assignee: International Business Machines Corporation
    Inventor: Nancy Ellen Kho
  • Publication number: 20150019592
    Abstract: Embodiments disclosed herein provide systems and methods for scaling reachability computations on relatively large graphs. In an embodiment, a method provides for scaling reachability computations on relatively large graphs, the method comprising, identifying an initial graph comprising a plurality of vertices and a plurality of edges, processing at least a portion of the plurality of vertices and at least a portion of the plurality of edges to generate a plurality of reachability indices for the at least a portion of the plurality of vertices, and generating a backbone graph comprising a scaled-down version of the initial graph, based at least in part on at least one of the plurality of reachability indices.
    Type: Application
    Filed: March 13, 2013
    Publication date: January 15, 2015
    Inventors: Ruoming Jin, Ning Ruan
  • Patent number: 8935255
    Abstract: In one embodiment, one or more computing devices assign each of a plurality of nodes of a graph of a social-networking system to one of a plurality of search indices. Each search index corresponds to a node type, and each node assigned to a search index is of the node type that the search index corresponds to. For each search index, the one or more computing devices determine a value for each node assigned to the search index based at least in part on edges connected to the node in the graph and rank the nodes assigned to the search index based at least in part on their values. The one or more computing devices provide the search indices for storage to facilitate responding to queries encompassing objects represented by the nodes assigned to the search indices.
    Type: Grant
    Filed: July 27, 2012
    Date of Patent: January 13, 2015
    Assignee: Facebook, Inc.
    Inventors: Sriram Sankar, Gintaras Andrius Woss, Rajat Raina, Maxim Gubin
  • Patent number: 8928665
    Abstract: Systems and methods are provided for supporting dynamic provenance annotations over data graphs. A method includes receiving a plurality of dynamic graphs representing dynamic provenance data. The method further includes evaluating a provenance query over the plurality of dynamic graphs to obtain an answer to the provenance query. The method additionally includes providing the answer to the provenance query to a user, using at least a display device.
    Type: Grant
    Filed: June 21, 2011
    Date of Patent: January 6, 2015
    Assignee: International Business Machines Corporation
    Inventors: Joana M. Fonseca Da Trindade, Anastasios Kementsietsidis, Mudhakar Srivatsa
  • Publication number: 20150006587
    Abstract: Some implementations generate multiple views of a combined data graph from disparate data graph sources in two phases. A first phase may convert each source data graph into a reconciled data graph and a second phase may generate a combined data graph from the various reconciled data graphs. For example, a method may include generating a reconciled data graph for each of a plurality of source data graphs and determining selected sources identified by a graph view file. The selected sources may be a subset of the plurality of sources represented by the source data graphs. The method may also include generating a combined data graph using the reconciled data graphs that correspond with the selected sources, and generating search results using the combined data graph.
    Type: Application
    Filed: June 27, 2013
    Publication date: January 1, 2015
    Inventor: Suresh Toby Segaran
  • Patent number: 8924385
    Abstract: A method for providing a query-based diagrammatic presentation of data includes generating a filter element that defines a set of groups and includes a set of declarative queries that define information to be included in the set of groups. The filter element is applied to a data source, which includes performing the set of declarative queries on the data source, thereby generating a set of query results for each of the groups. A diagram is generated that includes a set of shapes representing the set of groups, and a set of nodes nested within each of the shapes, wherein the nodes for each group are determined based on the query results for that group.
    Type: Grant
    Filed: April 12, 2011
    Date of Patent: December 30, 2014
    Assignee: Microsoft Corporation
    Inventors: Blair Stuart McGlashan, J. Duncan C. Pocklington, Jean-Marc Prieur, Stuart John Harding Kent, Eyal Lantzman
  • Patent number: 8918418
    Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, identifying a nodes corresponding to a page currently accessed by a first user, generating one or more structured queries, where each structured query comprises a reference to the identified node and one or more edges that are connected to the identified node, and transmitting one or more of the structured queries to the first user for display on the page.
    Type: Grant
    Filed: December 31, 2012
    Date of Patent: December 23, 2014
    Assignee: Facebook, Inc.
    Inventors: Yofay Kari Lee, Keith L. Peiris, William R. Maschmeyer, Lars Eilstrup Rasmussen, Aaron Sittig, Craig S. Campbell
  • Publication number: 20140372385
    Abstract: A method for a computer system includes receiving an identifier from a user, initiating a user session in response to the identifier, determining a social map for the user in response to the identifier and in response to a plurality of social network relationships, receiving a first change to the plurality of social network relationships from the user, receiving a second change to the plurality of network relationships from another user, determining a revised social map for the user during the user session in response to receiving the first change, but not in response to receiving the second change, wherein the revised social map for the user reflects the first change and the second change, and storing the revised social map for the user during the user session in a cache.
    Type: Application
    Filed: August 27, 2014
    Publication date: December 18, 2014
    Inventors: Paul J. Martino, Chris Vale, Kristopher C. Wehner
  • Patent number: 8914416
    Abstract: Building a semantics graph for an enterprise communication network can include calculating a distance metric between a first signifier and a second signifier associated with an enterprise communication network, wherein the distance metric includes a plurality of relationships defined based on a frequency of co-occurrences of the first signifier and the second signifier, and building a semantics graph for the enterprise communication network using the calculated distance metric.
    Type: Grant
    Filed: January 31, 2013
    Date of Patent: December 16, 2014
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Mehmet Kivanc Ozonat, Claudio Bartolini
  • Patent number: 8914378
    Abstract: A system for storing a specification document to be checked on a storage device in a computer readable format. A computer implemented method which stores a graph structure of rules for performance of checking, and creates a rule application table of whether a rule is an application subject. For each node rule of the graph structure, average entropy of whether a specification satisfies the rules is derived by searching the graph structure of rules. While performing a depth-first searching of the graph structure of rules, a priority order index is derived from the rule application table for each node rule. Amendment candidates are then displayed according to value of the priority order index.
    Type: Grant
    Filed: January 28, 2013
    Date of Patent: December 16, 2014
    Assignee: International Business Machines Corporation
    Inventors: Mari Fukuda, Taiga Nakamura
  • Publication number: 20140365531
    Abstract: In a computer-implemented method for creating a graph database of a virtualization infrastructure, data defining entities and relationships of the entities of a virtualization infrastructure is received at a graph database, wherein the relationships of the entities are in accordance with an inventory structure of the virtualization infrastructure. The graph database is populated with the entities and the relationships of the entities of the virtualization infrastructure.
    Type: Application
    Filed: June 7, 2013
    Publication date: December 11, 2014
    Inventors: Vijayaraghavan SOUNDARARAJAN, Lawrence SPRACKLEN
  • Patent number: 8903762
    Abstract: Methods, systems, and computer program products for generating code from a data flow associated with an extract, transform, and load (ETL) process. In one implementation, the method includes identifying a data exchange requirement between a first operator and a second operator in the data flow. The first operator is a graphical object that represents a first data transformation step in the data flow and is associated with a first type of runtime engine, and the second operator is a graphical object that represents a second data transformation step in the data flow and is associated with a second type of runtime engine. The method further includes generating code to manage data staging between the first operator and the second operator in the data flow. The code exchanges data from a format associated with the first type of runtime engine to a format associated with the second type of runtime engine.
    Type: Grant
    Filed: June 14, 2012
    Date of Patent: December 2, 2014
    Assignee: International Business Machines Corporation
    Inventors: Qi Jin, Hui Liao, Sriram Srinivasan, Lin Xu
  • Patent number: 8903824
    Abstract: A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.
    Type: Grant
    Filed: December 9, 2011
    Date of Patent: December 2, 2014
    Assignee: International Business Machines Corporation
    Inventors: Leman Akoglu, Rohit M. Khandekar, Vibhore Kumar, Srinivasan Parthasarathy, Deepak Rajan, Kun-Lung Wu
  • Publication number: 20140351290
    Abstract: Embodiments related to calculating node centralities in large and complex networks and graphs. An aspect includes approximating a product of a matrix exponential and a random probe vector of an adjacency matrix, wherein the adjacency matrix represents a graph. A diagonal of the adjacency matrix is computed based on the product of the matrix exponential and the random probe vector. The node centralities are then calculated based on the computed diagonal until a designated number of central nodes has been detected according to embodiments.
    Type: Application
    Filed: September 12, 2013
    Publication date: November 27, 2014
    Applicant: International Business Machines Corporation
    Inventors: Konstantinos Bekas, Alessandro Curioni
  • Publication number: 20140351261
    Abstract: A knowledge base provides a mechanism for storing an organization's data in a way that represents the semantics of the data being stored. The knowledge base may include a knowledge graph that represents relationships between the different classes of data comprising the organization's data. Data that is loaded into the knowledge graph may be stored in data tables associated with the knowledge graph, and cross referenced with node identifiers that contain the data. Searching the knowledge base includes parsing a search input to identify terms in the search input, and mapping the terms to nodes in the knowledge base using the cross referenced information. The relationships among the identified nodes are used to identify a suitable application for processing the search.
    Type: Application
    Filed: May 24, 2013
    Publication date: November 27, 2014
    Applicant: SAP AG
    Inventors: Jitender Aswani, Ryan Leask, Jens Doerpmund
  • Publication number: 20140351289
    Abstract: Embodiments relate to simplifying large and complex networks and graphs using global connectivity information based on calculated node centralities. An aspect includes calculating node centralities of a graph until a designated number of central nodes are detected. A percentage of the central nodes are then selected as pivot nodes. The neighboring nodes to each of the pivot nodes are then collapsed until the graph shrinks to a predefined threshold of total nodes. Responsive to the number of total nodes reaching the predefined threshold, the simplified graph is outputted.
    Type: Application
    Filed: May 22, 2013
    Publication date: November 27, 2014
    Applicant: International Business Machines Corporation
    Inventors: Konstantinos Bekas, Alessandro Curioni
  • Patent number: 8898135
    Abstract: Search keywords are acquired (S3), a first item and a second item displayable by scale axes are set in accordance with the search keywords (S4, S5), a search is made by the search keywords and the scale axis values of the items and a presence of search hits is found (S5), and display data for displaying a 2D distribution of the presence of search hits is generated by the scale axis values of the items in a plane with two axes including the scale axis of the first item and the scale axis of the second item (S11).
    Type: Grant
    Filed: May 30, 2011
    Date of Patent: November 25, 2014
    Assignee: Rakuten, Inc.
    Inventor: Soh Masuko
  • Patent number: 8898197
    Abstract: A method and apparatus for generating a data structure. A plurality of entity reference relationship structures is accessed. Each entity reference relationship structure establishes a relationship between a different pair of entity structures of a plurality of entity structures. Each path from a first vertex to a second vertex that corresponds to a second entity structure is determined. For each path, all coupled sets of pairs of entity instance identifiers, wherein each coupled set comprises a pair of entity instance identifiers from each entity reference relationship structure corresponding to the path are identified. For each coupled set, a first entity instance identifier in the each coupled set that refers to the first entity structure and a second entity instance identifier in the each coupled set that refers to the second entity structure are stored in association with one another in a new entity reference relationship structure.
    Type: Grant
    Filed: May 23, 2011
    Date of Patent: November 25, 2014
    Inventor: Bhargav Senjalia
  • Patent number: 8892605
    Abstract: Relationship management systems in accordance with embodiments of the invention are configured to provide systematic ways for a user to measure, and manage relationships in the user's social network. One embodiment of the invention includes a relationship management server system, and a database. In addition, the relationship management server system is configured to store a user account associated with a user in the database, store information concerning contacts associated with the user in the database, store event information associated with the user and at least one of the stored contacts in the database, store at least one objective in the database, score at least one relationship between the user and a contact based upon stored event information associated with the user and the contact to create a scored relationship graph, and generate a recommendation concerning an action based upon the stored objective and the scored relationship graph.
    Type: Grant
    Filed: December 5, 2011
    Date of Patent: November 18, 2014
    Assignee: Relationship Capital Technologies, Inc.
    Inventors: Andrew R. Wilson, John Slade, Daniel Bouganim, Sean L. Cramer
  • Publication number: 20140337387
    Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.
    Type: Application
    Filed: July 22, 2014
    Publication date: November 13, 2014
    Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
  • Patent number: 8887254
    Abstract: A database system comprising: a memory containing multiple data records, wherein each of the data records has a data record asymmetric key pair for cryptographic encryption and decryption, wherein each data record asymmetric key pair comprises a data record public key and a data record private key, wherein the data contained in each of the multiple data records is encrypted by the data record public key, wherein the data record private key of each data record asymmetric key pair is encrypted with the public key of another asymmetric key pair; a set of user accounts, wherein each of the user accounts has a user asymmetric key pair for encryption and decryption, wherein each user asymmetric key pair has a user public key and a user private key; wherein data is added to a data record by encrypting it with the data record public key; wherein access to the data record is granted to a user account by encrypting the data record private key with the public key of an asymmetric cryptographic key pair whose encrypted p
    Type: Grant
    Filed: December 15, 2010
    Date of Patent: November 11, 2014
    Assignee: Compugroup Medical AG
    Inventors: Adrian Spalka, Jan Lehnhardt
  • Patent number: 8886680
    Abstract: An apparatus, and corresponding method, for generating a graph used in performing a search for a match of at least one expression in an input stream is presented. The graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc may also include a nodal bit map including structural information of a node to which the valid arc points to. A walker process may utilize the nodal bit map to determine if a memory access is necessary. The nodal bit map reduces the number of external memory access and therefore reduces system run time.
    Type: Grant
    Filed: May 30, 2013
    Date of Patent: November 11, 2014
    Assignee: Cavium, Inc.
    Inventor: Rajan Goyal
  • Patent number: 8880558
    Abstract: A method for service creation based on graph mapping including constructing a graph having leaf nodes in an environment including business support nodes associated with respective services and operations support nodes including attribute models, identifying a plurality of services at a level of the leafs in the graph, extending the graph by representing existing services offerings in terms of operation level service definitions and new services at the level of the leafs, and re-combining leaf nodes to define new services at service creation time.
    Type: Grant
    Filed: July 1, 2010
    Date of Patent: November 4, 2014
    Assignee: International Business Machines Corporation
    Inventors: Yu Deng, Michael R. Head, Andrzej Kochut, Jonathan P. Munson, Anca Sailer, Hidayatullah Shaikh
  • Patent number: 8874617
    Abstract: Techniques, a system and an article of manufacture for determining potential enterprise partnerships. A method includes constructing an interaction graph for a set of multiple enterprises based on information pertaining to each of the enterprises and information pertaining to transactions conducted among the enterprises, and determining at least two candidate partnership teams among the set of enterprises based on at least one attribute of the graph, wherein each candidate partnership team comprises two or more of the enterprises.
    Type: Grant
    Filed: November 14, 2012
    Date of Patent: October 28, 2014
    Assignee: International Business Machines Corporation
    Inventors: Seema Nagar, Amit A. Nanavati, Ramasuri Narayanam, Amir Ronen, Steven Keller, Jason Hardy
  • Patent number: 8874616
    Abstract: Disclosed is a method for fusing interaction data, such as intelligence data, comprising, embodying collections of interaction data from different interaction data sources in interaction graphs, defining a plurality of mappings of identifiers to entities, associating each mapping with a fused interaction graph, and identifying an optimal mapping by evaluation of compatibility of identifier attributes, mutual information across interaction data sources, and/or fit with one or more behavior models. Edges in the fused graph can be collapsed. Also claimed are a computer system and a computer-readable medium for fusing interaction data.
    Type: Grant
    Filed: July 11, 2012
    Date of Patent: October 28, 2014
    Assignee: 21CT, Inc.
    Inventors: Thayne Richard Coffman, Jonathan William Mugan, Eric John McDermid
  • Publication number: 20140317051
    Abstract: A computer-implemented system and method for exploring and filtering an information space based on attributes via an interactive display is provided. Entities related to an information space are retrieved. Attributes associated with the entities are identified. The entities are displayed as a list. A status representation of the entities and at least one attribute graph based on one of the attributes from the entity list are presented. A status of a user with respect to one or more of the entities is tracked. The status for the one or more entities is received from the user. The user status is applied to the status representation and the attribute graph.
    Type: Application
    Filed: April 19, 2013
    Publication date: October 23, 2014
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Ellen Isaacs, Mudita Singhal
  • Publication number: 20140317148
    Abstract: A first processing element may be initially configured to transmit a first output stream to a second processing element. The second processing element may be initially configured to transmit a second output stream to a third processing element. The tuples of the first and second output streams may have the first and second attributes. It may be determined whether the first attribute is to be first processed at the second processing element (first condition) and whether the second attribute is to be first processed at the third processing element (second condition). When the first and second conditions are met, the first processing element may be reconfigured to transmit a third output stream to the second processing element and a fourth output stream to the third processing element. The third output stream may have only the first attribute. The fourth output stream may have only the second attribute.
    Type: Application
    Filed: April 17, 2013
    Publication date: October 23, 2014
    Applicant: International Business Machines Corporation
    Inventors: Michael J. Branson, Bradford L. Cobb, John M. Santosuosso
  • Patent number: 8868603
    Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query comprising an ambiguous n-gram, identifying nodes and edges that correspond to the ambiguous n-gram, generating a first set of structured queries corresponding to the identified second nodes and edges, receiving from the first user a selection of a first structured query form the first set, and generating a second set of structured queries based on the selected first structured query.
    Type: Grant
    Filed: December 31, 2012
    Date of Patent: October 21, 2014
    Assignee: Facebook, Inc.
    Inventors: Yofay Kari Lee, Keith L. Peiris, William R. Maschmeyer, Lars Eilstrup Rasmussen, Joshua Keith Duck
  • Patent number: 8860727
    Abstract: A method of automatically generating models from a dataset includes multiple steps. First, a description of a view of a dataset is provided. The description includes multiple fields associated with the dataset. Next, a set of properties is determined for each of the multiple fields. Finally, the description is automatically translated into one or more models based on the respective properties of the multiple fields and a set of predefined heuristics.
    Type: Grant
    Filed: August 16, 2011
    Date of Patent: October 14, 2014
    Assignee: Tableau Software, Inc.
    Inventors: Andrew C. Beers, Matthew W. Eldridge, Patrick M. Hanrahan, Jonathan E. Taylor
  • Patent number: 8856119
    Abstract: A method resolves ambiguous spotted entity names in a data corpus by determining an activation level value for each of a plurality of nodes corresponding to a single ambiguous entity name. The activation levels for each of the nodes may be modified by inputting outside domain knowledge corresponding to the nodes to increase the activation value of the nodes, spotting entity names corresponding to the nodes to increase the activation value of the nodes, searching the data corpus to spot newly posted entity names to increase the activation value of the nodes, and searching the data corpus to reduce or deactivate the activation value of the nodes by eliminating false positives. The ambiguous entity name is assigned to the node determined to have the highest activation level and is then outputted to a user.
    Type: Grant
    Filed: February 27, 2009
    Date of Patent: October 7, 2014
    Assignee: International Business Machines Corporation
    Inventors: Varun Bhagwan, Tyrone W. A. Grandison, Daniel F. Gruhl, Jan H. Pieper
  • Publication number: 20140297690
    Abstract: A disclosed method includes: obtaining, for each node of plural nodes in a graph, which are associated each other, a display position at which the node is displayed; calculating, for each node, a movement vector according to a total sum of forces in conformity with a mechanics model in which an inertial force does not work, wherein the total sum of the forces is obtained by adding, with respect to all of nodes other than the node, a force that works in association with a distance concerning the display position with another node; moving, for each node, the display position by the calculated movement vector; and while repeating or before the obtaining, the calculating and the moving, accepting an instruction corresponding to a user's operation for causing a display position of a certain node to be changed, and changing the display position of the certain node according to the instruction.
    Type: Application
    Filed: February 7, 2014
    Publication date: October 2, 2014
    Applicant: FUJITSU LIMITED
    Inventors: Takeshi OSOEKAWA, Takahisa ANDO, Seishi OKAMOTO
  • Patent number: 8849851
    Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks can be utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that can be serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.
    Type: Grant
    Filed: September 12, 2012
    Date of Patent: September 30, 2014
    Assignee: International Business Machines Corporation
    Inventors: Kavita Chavda, Nagapramod S. Mandagere, Ramani R. Routray, Pin Zhou
  • Patent number: 8849874
    Abstract: A method for modifying a mapping from at least one application path of a data system to a conceptual path of an ontology system is provided. The application path addresses a part of the structure of the data system, and the conceptual path addresses a part of the structure of the ontology system. The method comprises the steps detecting a change to a part of the structure of the ontology system one or more of the conceptual paths is addressing and updating the mappings to reflect the change to the part of the structure of the ontology system.
    Type: Grant
    Filed: April 27, 2010
    Date of Patent: September 30, 2014
    Assignees: Collibra NV/SA, Vrije Universiteit Brussel
    Inventors: Damien Trog, Stijn Christiaens, Pieter De Leenheer, Felix Urbain Yolande Van De Maele, Robert Alfons Meersman
  • Patent number: 8849747
    Abstract: Systems, methods, apparatus, and computer-readable media for business process management include identifying a business process model generated with a business process modeling tool; transforming the business process model defined in a first format to one or more artifacts defined in a second format; deploying an output file defined by the one or more artifacts in an in-memory database; and executing the output file in the in-memory database base at least in part on one or more processes executing in the in-memory database in response to a received query for data stored in the in-memory database.
    Type: Grant
    Filed: April 24, 2012
    Date of Patent: September 30, 2014
    Assignee: SAP AG
    Inventors: Sören Balko, Kesavaprakash Vasudevan
  • Publication number: 20140289281
    Abstract: An embodiment of a system for representing connectedness of individuals includes nodes representative of individuals and strands connecting the nodes. The nodes include a first node representative of a first individual and a second node representative of a second individual. The strands connect the first node and the second node. Each of the strands represents a type of relationship between the first individual and the second individual. In some embodiments, each of the strands is in the form of a distinct data object.
    Type: Application
    Filed: March 24, 2014
    Publication date: September 25, 2014
    Inventor: John Golze
  • Patent number: 8842119
    Abstract: Methods, apparatus, and articles of manufacture to display system performance information are disclosed. An example method involves normalizing data representative of an operation performed by a system, a first performance metric of the system, and an event that occurred during the operation and during measurement of the first performance metric. A first object indicative of a duration of the operation is displayed. A second object is displayed with the first object. The second object is indicative of the first performance metric during the performance of the operation. An event marker is displayed with the first and second objects. The event marker is indicative of the event. The event is representative of an instance in which the first performance metric exceeded a first threshold or fell below a second threshold. The first and second objects and the event marker are aligned along a same timeline in a same graph.
    Type: Grant
    Filed: November 17, 2010
    Date of Patent: September 23, 2014
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventor: Eric Hubbard
  • Patent number: 8843525
    Abstract: An apparatus and method for calculating the selectivity of a range query for multidimensional data using a multidimensional histogram are provided. A data space may be partitioned into one or more sub-spaces based on a sum of skew values of the one or more sub-spaces, a space-partitioning tree may be generated for the data space, and a multidimensional histogram may be generated for the data space based on the space-partitioning tree. A range query for multidimensional data may be processed based on the multidimensional histogram.
    Type: Grant
    Filed: August 31, 2011
    Date of Patent: September 23, 2014
    Assignee: Samsung Electronics Co., Ltd.
    Inventors: Yohan J. Roh, Myoung Ho Kim, Jaeho Kim