Graphs Patents (Class 707/798)
  • Patent number: 8719299
    Abstract: In one embodiment, an approach to automated recurring concept extraction, from a plurality of input data models (schemas) is presented. The approach converts input data models to graphs, with typed elements. The graphs are mined for closed subgraphs that have a defined minimum support. The identified subgraphs can be filtered with a relevance metric. These subgraphs are converted to schemas or an appropriate representation, and stored for reuse in a repository. The repository can be used to automate further transformation or mapping of schemas presented to a system that uses the repository. In one example, the repository is used in a schema covering process to perform schema transformation.
    Type: Grant
    Filed: December 2, 2011
    Date of Patent: May 6, 2014
    Assignee: SAP AG
    Inventors: Konrad Voigt, Peter Mucha
  • Publication number: 20140122473
    Abstract: Systems and methods are disclosed for providing a meta-social graph. In accordance with one implementation, a computerized method comprises collecting a plurality of different online identities of a first online user, each of the different online identities corresponding to a unique social network system. The method also includes collecting a plurality of communication data associated with the first user and determining bi-directional connections of the first user with other users from the collected communication data. In addition, the method may also include creating a meta-social graph from the determined bi-directional connections and the plurality of different online identities and generating a global identifier for the first user. The method also includes storing, in at least one memory device, the meta-social graph with at least one of the generated global identifier, the determined bi-directional connections, and the collected communication data.
    Type: Application
    Filed: October 28, 2013
    Publication date: May 1, 2014
    Applicant: AOL Inc.
    Inventors: George F. Fletcher, Lachlan A. Maxwell, Travis A. Walker
  • Patent number: 8713063
    Abstract: The invention broadly and generally provides, in a computer-controlled display, a method of simplifying a graphical representation of a set of connected nodes comprising the steps of: (a) selecting a subset of the aforesaid set; and (b) under computer program control, hiding representations of all nodes except (i) nodes within the aforesaid subset and (ii) at least one node having a defined relationship to the aforesaid subset.
    Type: Grant
    Filed: January 13, 2005
    Date of Patent: April 29, 2014
    Assignee: International Business Machines Corporation
    Inventors: Steven R. Abrams, Ian David Simmonds, John Vlissides
  • Patent number: 8713057
    Abstract: Techniques for data assignment from an external distributed file system (DFS) to a database management system (DBMS) are provided. Data blocks from the DFS are represented as first nodes and access module processors of the DBMS are represented as second nodes. A graph is produced with the first and second nodes. Assignments are made for the first nodes to the second nodes based on evaluation of the graph to integrate the DFS with the DBMS.
    Type: Grant
    Filed: December 29, 2011
    Date of Patent: April 29, 2014
    Assignee: Teradata US, Inc.
    Inventors: Yan Qi, Yu Xu, Olli Pekka Kostamaa, Jian Wen
  • Patent number: 8711146
    Abstract: Methods and apparatuses for constructing a multi-level solver, comprising decomposing a graph into a plurality of pieces, wherein each of the pieces has a plurality of edges and a plurality of interface nodes, and wherein the interface nodes in the graph are fewer in number than the edges in the graph; producing a local preconditioner for each of the pieces; and aggregating the local preconditioners to form a global preconditioner.
    Type: Grant
    Filed: November 29, 2007
    Date of Patent: April 29, 2014
    Assignee: Carnegie Mellon University
    Inventors: Gary Lee Miller, Ioannis Koutis
  • Publication number: 20140115010
    Abstract: Methods, and systems, including computer programs encoded on computer-readable storage mediums, including a method for providing a graph that includes entity nodes, label nodes and weighted connecting edges. The method comprises computing an aggregated incoming between-entity edge weight for the entity nodes. When there are positively-weighted incoming between-entity edges into the entity node, the method comprises replacing each of the between-entity edge weights by a pre-normalized between-entity edge weights. The method comprises computing an aggregated from-label weight for the entity node. When there are positively-weighted from-label node edges, the method comprises replacing the corresponding label weights by pre-normalized from-label weights. The method comprises determining influence values for a first, second and third influence factors, where the influence factors have values that sum to one.
    Type: Application
    Filed: February 27, 2013
    Publication date: April 24, 2014
    Inventors: Rohan Seth, Shumeet Baluja, Michele Covell
  • Patent number: 8700607
    Abstract: A data processing system processes transaction database information to predict future demand using data regression techniques to extract trend line information from historical pattern frequency values. By extrapolating the trend line, a predicted pattern frequency value may be calculated. By applying regression techniques (such as least-squares approximation), the trend line information may be extracted and projected to predict the future pattern frequency which may be applied to calculate the expected value of a recommendation rule.
    Type: Grant
    Filed: July 27, 2006
    Date of Patent: April 15, 2014
    Assignee: Versata Development Group, Inc.
    Inventor: Andrew Maag
  • Patent number: 8700673
    Abstract: Metadata search is enhanced by utilizing relationship data indicating relationships between metadata items. A server generates an index mapping metadata items to terms associated with the metadata items and a graph describing relationships between each of the metadata items. When the server receives a search request, the server locates a candidate set of the metadata items based on the search term(s) and the index. The server performs a link analysis of the graph to determine a relationship score for each metadata item. For each particular metadata item in the candidate set of the metadata items, the server calculates a ranking score based at least on the relationship score for the particular metadata item. The server generates a ranked result set based on comparing the ranking scores for the candidate set of metadata items. The server then provides information indicating the ranked result set in response to the search request.
    Type: Grant
    Filed: February 16, 2012
    Date of Patent: April 15, 2014
    Assignee: Oracle International Corporation
    Inventors: Nikhil Raghavan, Ravi Murthy, Aman Naimat
  • Publication number: 20140099623
    Abstract: In one exemplary embodiment, a computer-implemented method of generating an implicit social graph is provided. The method can include the step of receiving a first eye-tracking data of a first user. The first eye-tracking data can be associated with a first component. The eye-tracking data can be received from a first user device. A second eye-tracking data can be received from a second user. The second eye-tracking data can be associated with a second visual component. The second eye-tracking data can be received from a second user device. One or more attributes can be associated with the first user. The one or more attributes can be determined based on an association of the first eye-tracking data and the first visual component. One or more attributes can be associated with the second user. The one or more attributes can be determined based on an association of the second eye-tracking data and the second visual component.
    Type: Application
    Filed: October 4, 2012
    Publication date: April 10, 2014
    Inventors: Karmarkar V. Amit, Richard R. Peters
  • Patent number: 8694548
    Abstract: Defense-in Depth security defines a set of graduated security tasks, each of which performs a task that must complete before another task can complete. Only when these tasks complete successfully and in the order prescribed by Defense-in-Depth security criteria is a final process allowed to execute. Through such Defense-in-Depth security measures, vulnerable software, such as bytecode, can be verified as unaltered and executed in a secure environment that prohibits unsecured access to the underlying code.
    Type: Grant
    Filed: December 22, 2011
    Date of Patent: April 8, 2014
    Assignee: Cisco Technology, Inc.
    Inventors: Sreenivas Devalla, Satyanarayana D V Raju, Sridhararao V. Kothe, Nakka Siva Kishore Kumar
  • Patent number: 8694549
    Abstract: Dynamic management of multiple persistent data stores is disclosed. One or more data objects are retrieved from two or more of a plurality of persistent data stores and provided to the client context in a manner such that the one or more data objects appear to the client context to come from a single source, even if in fact the objects have been retrieved from two or more different persistent stores.
    Type: Grant
    Filed: May 30, 2012
    Date of Patent: April 8, 2014
    Assignee: Apple, Inc.
    Inventors: Bill Bumgarner, Christopher M. Hanson, Ronald Dennis Lue-Sang, Stephen E. Miner, Benjamin Trumbull, Melissa Turner, Andreas Wendker
  • Patent number: 8694547
    Abstract: Provided is a system and method to perform dynamic state-space partitioning in external memory graph searching. The dynamic partitioning of the state-space search graph leading to substantial improvement of search performance.
    Type: Grant
    Filed: July 7, 2009
    Date of Patent: April 8, 2014
    Assignee: Palo Alto Research Center Incorporated
    Inventor: Rong Zhou
  • Publication number: 20140095474
    Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.
    Type: Application
    Filed: September 30, 2013
    Publication date: April 3, 2014
    Applicant: Oracle International Corporation
    Inventors: Sunil P. Chakkappen, Mohamed Zait, Allison W. Lee, Ali Cakmak
  • Patent number: 8688701
    Abstract: Ranking and selecting entities based on calculated reputation or influence scores is provided. In some embodiments, a method includes determining whether a first entity is a subject or an object; determining whether a second entity is a subject or an object; and generating a graph, in which a subset of the graph is a subject graph of subject nodes that includes at least one or more subjects (e.g., subject entities) linked to one or more other subjects, and in which the graph includes one or more objects (e.g., object entities) each linked to one or more subjects in the subject graph. In some embodiments, the graph includes directed and undirected links. In some embodiments, the graph includes one or more objects linked to one or more objects.
    Type: Grant
    Filed: December 1, 2009
    Date of Patent: April 1, 2014
    Assignee: Topsy Labs, Inc
    Inventors: Rishab Aiyer Ghosh, Vipul Ved Prakash
  • Publication number: 20140089351
    Abstract: Computer-implemented method, system, and computer program product for processing data in an out-of-order manner in a streams computing environment. A windowing condition is defined such that incoming data tuples are processed within a specified time or count of each other. Additionally, the windowing condition may be based on a specified attribute of the data tuples. If the tuples are not processed within the constraints specified by the windowing condition, the unprocessed tuples may be discarded, i.e., not processed, to optimize operator performance.
    Type: Application
    Filed: September 25, 2012
    Publication date: March 27, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael J. Branson, Ryan K. Cradick, John M. Santosuosso, Brandon W. Schulz
  • Publication number: 20140089352
    Abstract: Computer-implemented method, system, and computer program product for processing data in an out-of-order manner in a streams computing environment. A windowing condition is defined such that incoming data tuples are processed within a specified time or count of each other. Additionally, the windowing condition may be based on a specified attribute of the data tuples. If the tuples are not processed within the constraints specified by the windowing condition, the unprocessed tuples may be discarded, i.e., not processed, to optimize operator performance.
    Type: Application
    Filed: February 25, 2013
    Publication date: March 27, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael J. Branson, Ryan K. Cradick, John M. Santosuosso, Brandon W. Schulz
  • Patent number: 8682933
    Abstract: A directed graph comprises a plurality of nodes including a root node and a non-root node. Each of the plurality of nodes has a plurality of directed edges. The directed graph is traversed, with the plurality of nodes being visited according to an order of the directed edges of each of the plurality of nodes. The directed edge that leads to the non-root node is discarded when the non-root node is visited for the first time during the traversal of the directed graph.
    Type: Grant
    Filed: April 5, 2012
    Date of Patent: March 25, 2014
    Assignee: Fujitsu Limited
    Inventor: Stergios Stergiou
  • Patent number: 8682932
    Abstract: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.
    Type: Grant
    Filed: February 16, 2012
    Date of Patent: March 25, 2014
    Assignee: Oracle International Corporation
    Inventors: Nikhil Raghavan, Ravi Murthy, Aman Naimat
  • Patent number: 8676818
    Abstract: A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system.
    Type: Grant
    Filed: May 3, 2010
    Date of Patent: March 18, 2014
    Assignee: International Business Machines Corporation
    Inventors: Francisco Phelan Curbera, Paul T. Keyser, Rania Khalaf, Geetika Tewari Lakshmanan
  • Patent number: 8676857
    Abstract: A graph database storage system contains a graph database that has multiple graph nodes. A first pointer points from a particular graph node to a particular synthetic context event node in a synthetic context event database. A second pointer points from the particular synthetic context event node in the synthetic context event database to a particular data store in a data structure, such that the first pointer and the second pointer associate the particular data store with the particular entity represented in the graph database via the particular synthetic context event node.
    Type: Grant
    Filed: August 23, 2012
    Date of Patent: March 18, 2014
    Assignee: International Business Machines Corporation
    Inventors: Samuel S. Adams, Robert R. Friedlander, John K. Gerken, III, James R. Kraemer
  • Patent number: 8676866
    Abstract: Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory.
    Type: Grant
    Filed: March 19, 2012
    Date of Patent: March 18, 2014
    Assignee: SAP AG
    Inventors: Jens Lemcke, Michael Dietrich, Gunther Stuhec
  • Patent number: 8676909
    Abstract: The present invention pertains to a method for delivering messages in a social network to increase a signal-to-noise ratio for the recipients of messages, characterized in that a process mechanism comprises of a diffusion process and a selection process combined through an adaptive process, in which: the diffusion process dispatches each message through dynamic routing graphs defined between the sender user and a set of potentially interested recipient users; the selection process locally filters the messages that are transmitted from sender users and received by potentially interested recipient users, according to the result of the application of a selection function on the metadata values constituting a message profile extracted from each transmitted message and weighted feature values constituting a user profile of the recipient to establish an estimate of interest for the user regarding each message, and the adaptive process continuously adjusts processing functions to adapt the graphs structure accord
    Type: Grant
    Filed: June 15, 2010
    Date of Patent: March 18, 2014
    Assignee: Semiocast
    Inventors: Paul Guyot, Jean-Charles Campagne
  • Publication number: 20140074893
    Abstract: In a network environment between a group of endpoint computing devices, where content is shared between the group of endpoint computing devices via a social network platform, techniques are described herein for receiving a social activity feed associated with the social network platform, the social activity feed including activities occurring within the social network platform. An algorithm is applied to a social graph of a user at an endpoint computing device of the group to determine a prioritization of nodes within the user's social graph, activities within the social activity feed are associated with nodes of the user's social graph, and recommendations are provided to the user of activities within the social activity feed that correspond with prioritized nodes of the user's social graph.
    Type: Application
    Filed: January 15, 2013
    Publication date: March 13, 2014
    Applicant: CISCO TECHNOLOGY, INC.
    Inventor: Keith Griffin
  • Publication number: 20140067873
    Abstract: An embodiment of the invention pertains to a weighted directed graph comprising multiple nodes and edges that each extends between two nodes. The embodiment includes processing edges to generate a forward and reverse edge corresponding to each edge. Forward and reverse edges are processed to generate indirect edges, each comprising two edge components, and extending between two nodes. One node associated with each forward edge, each reverse edge, and each indirect edge is selected to be the key node of its associated edge. All forward, reverse and indirect edges having a particular node as their respective key nodes are placed into a group. All edges of the group are then selectively processed to provide information pertaining to an egonet of the graph that has the particular node as its egonode.
    Type: Application
    Filed: June 26, 2012
    Publication date: March 6, 2014
    Applicant: International Business Machines Corporation
    Inventors: Marcel C. Rosu, Hanghang Tong
  • Patent number: 8667012
    Abstract: Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed.
    Type: Grant
    Filed: January 11, 2012
    Date of Patent: March 4, 2014
    Assignee: salesforce.com, inc.
    Inventors: Matthew Fuchs, Arun Kumar Jagota
  • Patent number: 8667009
    Abstract: Methods and systems for indexing, storing, recalling and displaying social network user profiles, event calendar postings and user feed postings are described. A single, discrete set of keywords, can be utilized and assigned to both user profiles and postings and can operate as a method of indexing. The assignment of these keywords may allow users to control the display of calendar and feed content by matching assigned posting keywords to assigned profile keywords via a matching algorithm. Matched event-related postings may also be automatically displayed in a user's calendar. Searches of profiles and postings may also be performed by constructing queries using the same set of discrete keywords attached to profiles and postings. Users may have the ability to control the display of specific profile information and postings via privacy settings, which utilize unique methods of tracking relationship segmentation and social distance.
    Type: Grant
    Filed: January 20, 2012
    Date of Patent: March 4, 2014
    Assignee: Saambaa LLC
    Inventors: Matthew Voigt, Michael Petanovitch
  • Publication number: 20140059083
    Abstract: A graph database storage system contains a graph database that has multiple graph nodes. A first pointer points from a particular graph node to a particular synthetic context event node in a synthetic context event database. A second pointer points from the particular synthetic context event node in the synthetic context event database to a particular data store in a data structure, such that the first pointer and the second pointer associate the particular data store with the particular entity represented in the graph database via the particular synthetic context event node.
    Type: Application
    Filed: August 23, 2012
    Publication date: February 27, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: SAMUEL S. ADAMS, ROBERT R. FRIEDLANDER, JOHN K. GERKEN, III, JAMES R. KRAEMER
  • Publication number: 20140059084
    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: Application
    Filed: August 27, 2012
    Publication date: February 27, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: SAMUEL S. ADAMS, ROBERT R. FRIEDLANDER, JOHN K. GERKEN, III, JAMES R. KRAEMER
  • Patent number: 8661061
    Abstract: A method for generating a tree-type data structure composed of a plurality of data strings includes the steps of: summing, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at least one given string position in each of the plurality of data strings; and classifying, based on the numbers of the data types respectively summed at the at least one given string position in the summing step, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.
    Type: Grant
    Filed: May 22, 2012
    Date of Patent: February 25, 2014
    Assignee: Nintendo Co., Ltd.
    Inventor: Minoru Hatamoto
  • Patent number: 8661066
    Abstract: Systems and methods for automatically processing a textual document by identifying occurrences of a piece of text having a predetermined format in the textual document; determining a depth-of-treatment value for each piece of formatted text in the textual document, the depth-of-treatment value indicating a depth of treatment in the textual document afforded to the particular piece of formatted text; associating an abstract with each piece of formatted text in the textual document; and generating a data record containing each identified piece of formatted text from the textual document, the depth-of-treatment value and the abstract associated with each piece of formatted text in the textual document.
    Type: Grant
    Filed: June 13, 2012
    Date of Patent: February 25, 2014
    Assignee: West Service, Inc.
    Inventors: Forrest Rhoads, Daniel Gannon, Paul Werner, Steve Hestness, Kimberly Anne Kothe, Jonathan James Medin, Nick Bieter
  • Publication number: 20140046981
    Abstract: A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.
    Type: Application
    Filed: August 8, 2012
    Publication date: February 13, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: SAMUEL S. ADAMS, ROBERT R. FRIEDLANDER, JOHN K. GERKEN, III, JAMES R. KRAEMER
  • Publication number: 20140046983
    Abstract: A method for use in analysing time series data, the method including determining a relationship coefficient between each pair of a plurality of data sets, each data set being indicative of variable values of a corresponding variable over time, and the relationship coefficient being indicative of a degree of relatedness between the pair of data sets, displaying a first representation including first nodes indicative of first data sets, the first data sets being selected ones of the data sets, determining selection of at least two second data sets from the first data sets and displaying a second representation, the second representation including an animation over time of a second node, the second node being animated based on the variable values for the second data sets.
    Type: Application
    Filed: July 11, 2013
    Publication date: February 13, 2014
    Inventors: John Julian GALLOWAY, Adam BROADWAY, Nicholas DAVIE, Douglas John ATKINSON
  • Publication number: 20140046982
    Abstract: Systems and processes for storing correlated data in a graph database are described. A first user node may be stored. In response to a request, a first event node and a second user node may be stored. The first event node may be associated with the first user node through an edge indicating participation. The first event node may be associated with the second user node through an edge indicating participation. In response to a content access, a second event node and a content node may be stored. The second event node may be associated with the first user node through an edge indicating participation. The second event node may be associated with the content node through an edge indicating usage. The first user node may be associated with the content node through an edge indicating the first user node handles the content node.
    Type: Application
    Filed: August 13, 2012
    Publication date: February 13, 2014
    Applicant: Magnet Systems Inc.
    Inventors: Robyn J. CHAN, Magdi Morsi
  • Patent number: 8650220
    Abstract: Systems and methods for storing and retrieving geospatial data in a geographic information system are provided. Geospatial data can be spatially partitioned along axes of a spherical coordinate system associated with a virtual globe or other spheroid into a plurality of discrete geospatial volumes pursuant to a hierarchical spatial partitioning scheme. For instance, geospatial data can be spatially partitioned into geospatial volumes along surfaces of constant latitude, longitude, and altitude defined by the spherical coordinate system. The discrete geospatial volumes can be stored as nodes in a hierarchical tree data structure. Additional methods are provided for portioning geospatial objects, such as tiles or discrete geospatial volumes, in tritree to reduce polar distortions.
    Type: Grant
    Filed: June 21, 2012
    Date of Patent: February 11, 2014
    Assignee: Google Inc.
    Inventors: John H. Rohlf, Matthew Dexter Hancher
  • Patent number: 8650181
    Abstract: In one embodiment the present invention includes an OLAP execution model using relational operations. In one embodiment, the present invention includes, a method comprising receiving a first query in an online analytic processor (OLAP) executing on one or more computers, the OLAP generating and comprising a model specifying a graph defining a plurality of nodes and a plurality of tiers, each node corresponding to a different operation on data. A second query is generated by the OLAP. The second query includes a plurality of layered subqueries each corresponding to one of the nodes in the graph for specifying the different operations on data. The second query is received in a relational engine coupled to the datastore. The relational engine executes the second query, and in accordance therewith, retrieves data.
    Type: Grant
    Filed: November 22, 2010
    Date of Patent: February 11, 2014
    Assignee: SAP AG
    Inventors: Stefan Dipper, Erich Marschall, Tobias Mindnich, Daniel Baeumges, Christoph Weyerhaeuser
  • Patent number: 8650165
    Abstract: Described herein are systems and methods for providing data policy management over application objects in a storage system environment. An application object may comprise non-virtual or virtual objects (e.g., non-virtual-based applications, virtual-based applications, or virtual storage components). An application object manager may represent application objects by producing mapping graphs and/or application object data that represent application objects in a standardized manner. A mapping graph for an application object may describe a mapping between the application object and its underlying storage objects on a storage system. Application object data may describe a mapping graph in a standardized format. Application object data representing application objects may be received by an application policy manager that manages data policies on the application objects (including virtual applications and virtual storage components) based on the received application object data.
    Type: Grant
    Filed: November 3, 2010
    Date of Patent: February 11, 2014
    Assignee: NetApp, Inc.
    Inventors: Neelesh M. Thakur, Kumar Parthasarathi, Vani Bappanadu, Santosh C. Lolayekar, Balamurali Palaiah, Boris Teterin
  • Publication number: 20140040284
    Abstract: A computer-implemented method for monitoring an object-oriented application is disclosed. A transaction-representative-digraph is built based upon a real-time running of the application, and the digraph contains nodes of a plurality of replaceable classes. A key node is selected based upon invocation relationships between the nodes. A monitor program is instrumented at the selected key node.
    Type: Application
    Filed: October 14, 2013
    Publication date: February 6, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Yang Che, Zhi Da Luo, Li Jing Mu, Zhi Hua Pan
  • Patent number: 8645402
    Abstract: Trip data that includes points traversed during corresponding trips is received. Transportation network data that describes geographic locations and links between the geographic locations is received. The trip data and transportation network data are partitioned across a plurality of processing units executing on one or more processors. At each of the plurality of processing units, a subset of the trip data at the corresponding processing unit is locally matched to a subset of the transportation network data at the corresponding processing unit to identify a subset of paths of the transportation network data traversed by one or more of the trips.
    Type: Grant
    Filed: December 22, 2009
    Date of Patent: February 4, 2014
    Assignee: Teradata US, Inc.
    Inventors: Peter Gerritson, Michael W. Watzke
  • Patent number: 8645429
    Abstract: Resolving conflicting graph mutations in a distributed computing system. Graph data for at least a partition of a graph is stored in a worker system of a distributed computing system. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. A plurality of conflicting mutation requests are received to mutate the graph. A conflict between the mutation requests is resolved with a conflict resolution function that lacks direct access to the graph data. The graph data is updated responsive to a result generated by resolving the conflict using the conflict resolution function.
    Type: Grant
    Filed: March 28, 2012
    Date of Patent: February 4, 2014
    Assignee: Google Inc.
    Inventors: Aart J. C. Bik, Matthew H. Austern, James C. Dehnert, Grzegorz Czajkowski, Grzegorz Malewicz, Naty Leiser
  • Patent number: 8645339
    Abstract: A method, system and computer program product for managing and querying a graph. The method includes the steps of: receiving a graph; partitioning the graph into homogeneous blocks; compressing the homogeneous blocks; and storing the compressed homogeneous blocks in files where at least one of the steps is carried out using a computer device.
    Type: Grant
    Filed: November 11, 2011
    Date of Patent: February 4, 2014
    Assignee: International Business Machines Corporation
    Inventors: U Kang, Ching-Yung Lin, Jimeng Sun, Hanghang Tong
  • Publication number: 20140032606
    Abstract: Various embodiments include at least one of systems, methods, software, and data structures for creating, modifying, and presenting collapsible groups in graphical workflow models in workflow process applications. Some embodiments include providing a presentable workflow modeling user interface including a graphical model of a modeled workflow process including multiple elements and receiving data indicative of first input selecting at least two elements to be grouped. Such an embodiment may further include building a data structure representative of the at least two elements to be grouped, storing the data structure, and modifying the graphical model by replacing the at least two elements to be grouped with a single element representative of the grouping.
    Type: Application
    Filed: August 20, 2009
    Publication date: January 30, 2014
    Applicant: Adobe Systems Incorporated
    Inventors: Elham Chandler, Jingqi Xian
  • Publication number: 20140033083
    Abstract: A method including receiving input identifying a panel associated with a software application, the software application including a Graphical User Interface (GUI) and the panel comprising a discrete area of the GUI within which to group software objects to control the software application. Additionally, the method includes processing the input to identify an object of the software objects to be included in the panel. Further, the method includes generating a panel definition including the object and dimensions of the panel, the panel definition to be processed to render the GUI.
    Type: Application
    Filed: August 29, 2008
    Publication date: January 30, 2014
    Inventor: John Nack
  • Publication number: 20140032607
    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: September 27, 2013
    Publication date: January 30, 2014
    Applicant: Cavium, Inc.
    Inventors: Muhammad R. Hussain, David A. Carlson, Gregg A. Bouchard, Trent Parker
  • Patent number: 8639689
    Abstract: In response to a query of discernable facial attributes, the locations of distinct and different facial regions are estimated from face image data, each relevant to different attributes. Different features are extracted from the estimated facial regions from database facial images, which are ranked in base layer rankings by matching feature vectors to a base layer ranking sequence as a function of edge weights. Second-layer rankings define second-layer attribute vectors as combinations of the base-layer feature vectors and associated base layer parameter vectors for common attributes, which are matched to a second-layer ranking sequence as a function of edge weights. The images are thus ranked for relevance to the query as a function of the second-layer rankings.
    Type: Grant
    Filed: January 9, 2013
    Date of Patent: January 28, 2014
    Assignee: International Business Machines Corporation
    Inventors: Ankur Datta, Rogerio S. Feris, Sharathchandra U. Pankanti, Daniel A. Vaquero
  • Patent number: 8635233
    Abstract: Techniques to automatically build a language dependency graph for localizable resources are described. A technique may include storing resources from a file in a translation database with data that indicates the language that the resource is in, the entity that created that version of the resource, and a dependency, if any, on a different language version of the resource. Subsequent translations of a resource may also be stored in the translation database in a manner that groups the translated version(s) of a resource to the original resource, and also stores the language of the resource, the entity that translated it, and the dependency to the language from which the resource was translated. A language dependency graph may be generated from the translation database for a file, where the graph reflects the languages of translation and dependency relationships among the translations. Other embodiments are described and claimed.
    Type: Grant
    Filed: June 27, 2011
    Date of Patent: January 21, 2014
    Assignee: Microsoft Corporation
    Inventors: Eric Borzello, Zhigiang Feng, Huy Nguyen
  • Publication number: 20140019490
    Abstract: Examples of the present disclosure may include methods, systems, and computer readable media with executable instructions. An example method for event processing for graph-structured data can include storing graph structured data. The graph structured data includes a plurality of vertex, edge, and/or property graph elements. The example method further includes defining a first graph view of a characteristic of vertex, edge, and/or property graph elements. A subgraph is determined as a subset of the plurality of vertex, edge, and/or property graph elements that have the characteristic of vertex, edge, and/or property graph elements defined by the first graph view. The vertex, edge, and/or property graph elements of the subgraph are processed responsive to a predefined event that occurs on at least one of the vertex, edge, and/or property graph elements of the subgraph.
    Type: Application
    Filed: July 13, 2012
    Publication date: January 16, 2014
    Inventors: Indrajit Roy, Alvin Au Young, Vanish Talwar, Michael Mihn-Jong Lee
  • Patent number: 8631094
    Abstract: Systems and methods for checkpointing a computation distributed over multiple peer servers. On each server, sequentially storing checkpoints collectively representing a current state of the computation on that server as of a most recent checkpoint, each checkpoint having a checkpoint timestamp. When restarting a first server, rebuilding a most recent state of the first server from the checkpoints written by the first server through a most recent checkpoint having a most recent checkpoint timestamp, and requesting from each of the other peer servers updates from the most recent checkpoint timestamp time of the first server. On each server, in response to a first request for updates as of a particular time, deriving the requested updates from the state data in the server uncommitted to a checkpoint and the state data in checkpoints of the server that have a timestamp no earlier than the particular time of the first request, and providing the requested updates to the first server.
    Type: Grant
    Filed: August 7, 2009
    Date of Patent: January 14, 2014
    Assignee: Google Inc.
    Inventors: Jesse Louis Alpert, Nissan Hajaj
  • Patent number: 8631044
    Abstract: A method, system, computer program product and computer readable media for matching using degree distribution information are disclosed. An embodiment of the method can include performing b-matching on a graph data structure expanded using degree distribution information in order to identify neighbors of a selected input node. The b-matching can be performed using belief propagation. The belief propagation method is adapted to use a compressed message update rule and to be suitable for use with distributed processing systems. An embodiment can also include enhancing a matching result by applying degree distribution information to a first matching result to generate a second matching result. Embodiments for online advertisement/search term matching, product recommendation, dating service and social network matching, auction buyer/seller matching and resource allocation, among other, are disclosed.
    Type: Grant
    Filed: December 11, 2009
    Date of Patent: January 14, 2014
    Assignee: The Trustees of Columbia University in the City of New York
    Inventors: Tony Jebara, Bert Huang
  • Patent number: 8631043
    Abstract: A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.
    Type: Grant
    Filed: December 9, 2009
    Date of Patent: January 14, 2014
    Assignee: Alcatel Lucent
    Inventors: Fang Hao, Muralidharan Kodialam, Tirunell V. Lakshman, Haoyu Song
  • Publication number: 20140012884
    Abstract: Various embodiments of the invention relate to optimizing storage of schema-less data. At least one of a schema-less dataset including a plurality of resources one or more query workloads associated with the plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A schema is generated based on the graph that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph.
    Type: Application
    Filed: June 27, 2013
    Publication date: January 9, 2014
    Inventors: Mihaela Ancuta BORNEA, Julian DOLBY, Achille Belly FOKOUE-NKOUTCHE, Anastasios KEMENTSIETSIDIS, Kavitha SRINIVAS