Entries |
Document | Title | Date |
20100082693 | ORGANIZATION OF A CONTACT LIST BASED ON SOCIAL NETWORK CONTEXT - The method includes determining a social network weighting for one or more contacts in a contact list, and arranging the contact list as a function of the social network weighting for the one or more contacts. The social network weightings may be determined as a function of social network context, which may include social network interactions, social network associations, or social network activities. | 04-01-2010 |
20100082694 | QUERY LOG MINING FOR DETECTING SPAM-ATTRACTING QUERIES - Disclosed are methods and apparatus for detecting spam-attracting queries. In one embodiment, one or more graphs are generated using data obtained from a query log, where the one or more graphs include at least one of an anticlick graph or a view graph. Values of one or more syntactic features of the one or more graphs are ascertained. Values of one or more semantic features of the one or more graphs are determined by propagating categories from a web directory among nodes in each of the one or more graphs. Spam-attracting queries are then detected based upon the values of the syntactic features and the semantic features. | 04-01-2010 |
20100082695 | ENTERPRISE SOCIAL GRAPH AND CONTEXTUAL INFORMATION PRESENTATION - A system for aggregating social graph information uses both social networking and social media sites as well as optional access to enterprise data so that a detailed and comprehensive social graph can be generated. The social graph information is provided to users when contextually appropriate. Other contextually appropriate information can be displayed to users as they undertake different tasks. | 04-01-2010 |
20100100569 | Method of Accelerating the Shortest Path Problem - The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance. | 04-22-2010 |
20100138448 | CATEGORY-BASED NAME SCHEMES IN PARSING FRAMEWORKS - According to some embodiments, categories and an associated category graph may be determined for a parsing framework. Moreover, a type for the parsing framework may be defined, wherein at least one category is automatically created and inserted into the category graph for an implementation element of the defined type. Namespaces may be automatically defined for the categories based at least in part on inheritance relationships associated with the categories in the category graph. | 06-03-2010 |
20100274815 | System and method for indexing, correlating, managing, referencing and syndicating identities and relationships across systems - A networking database containing a plurality of records for different identities in which identities are connected to one another by defined or interpreted Inter-Personal and Intra-Personal relationships. Individuals using the system may define, group and categorize specific identities and relationships; the system may also define, categorize and group both identities and relationships belonging to individuals registered with the system and unregistered users through computational analysis. Identities and relationships may be discovered by the system via an opt-in user-provided mechanism, via a third-party providing information, or through the system's own discovery. Identity and Relationship data can then be used to customize content. | 10-28-2010 |
20100281065 | METHOD FOR ADDING A DATA ITEM TO A COMPOSITION OF DATA ITEMS - A method for adding a data item to a composition of data items, the composition of data items including at least two data items which are partially adjacent with respect to one another, the composition defining at least one composite corner, wherein a vertex of a data item is a free vertex if it does not lie substantially on, against or within a boundary of another data item, the composition defining by a first convex polygon determined by joining all contiguous free vertices of the at least two data items using straight line segments, the method including selecting a candidate data item from a set of data items; selecting a candidate position in the composition, a candidate position being substantially on or against a composite corner, or within a boundary of another data item adjacent to a composite corner; placing the selected data item at the candidate position to create a further composition; and accepting the placement of the selected data item if the further composition defines a further convex polygon. | 11-04-2010 |
20100306271 | Query Networks Evaluation System and Method - A query network is disclosed, comprising sets of nodes and edges connecting pairs of nodes. The nodes of the query network are associated with edge-defining queries. A method is taught for fully evaluating such a query network. A language is further disclosed for constructing queries. The query network may be used to model a social network, a professional network or the like. | 12-02-2010 |
20110004631 | FREQUENT CHANGING PATTERN EXTRACTION DEVICE - A frequent changing pattern extraction device ( | 01-06-2011 |
20110010396 | SYSTEM AND METHOD FOR DYNAMIC STATE-SPACE ABSTRACTIONS IN EXTERNAL-MEMORY AND PARALLEL GRAPH SEARCH - 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. | 01-13-2011 |
20110016154 | PROFILE-BASED AND DICTIONARY BASED GRAPH CACHING - Methods and apparatuses are disclosed for caching portions of a Deterministic Finite Automata (DFA) graph during a compilation stage prior to a run-time stage that identifies attack traffic based on the graph. Cacheable components are identified based on a traffic profile, a dictionary of keywords, and/or a geometrical configuration of the graph. Techniques are disclosed for performing various types of caching alone or in combination with other types. Caching based on a dictionary or profile exploit a tendency of graph traversals performed during non-attack scenarios to remain near root nodes that correspond to the start of patterns designating blacklist traffic. By caching nodes that are near root nodes and that are visited frequently during peacetime (non-attack) scenarios, significant cache hits may be achieved during run-time execution. Caching graph components while compiling patterns using presently disclosed techniques avoids the need for expensive hardware to learn what and when to cache. | 01-20-2011 |
20110029571 | Query Optimization Over Graph Data Streams - An illustrative embodiment includes a method for executing a query on a graph data stream. The graph stream comprises data representing edges that connect vertices of a graph. The method comprises constructing a plurality of synopsis data structures based on at least a subset of the graph data stream. Each vertex connected to an edge represented within the subset of the graph data stream is assigned to a synopsis data structure such that each synopsis data structure represents a corresponding section of the graph. The method further comprises mapping each received edge represented within the graph data stream onto the synopsis data structure which corresponds to the section of the graph which includes that edge, and using the plurality of synopsis data structures to execute the query on the graph data stream. | 02-03-2011 |
20110072053 | METHOD FOR EFFICIENT DATA TRANSFORMATION - A digraph including a plurality of ordinary nodes, at least one of a composition node and a decomposition node, and a plurality of arcs interconnecting any of said nodes. | 03-24-2011 |
20110093506 | Controlling Access of User Information Using Social-Networking Information - Particular embodiments access a query submitted by a first user; retrieve information concerning one or more second users; retrieve a degree of separation between the first user and each second user within a social-networking system; and for each second user, if the degree of separation between the first user and the second user is less than or equal to a threshold degree of separation, then send the information concerning the second user to the first user in response to the query. | 04-21-2011 |
20110270890 | Method for Detecting Link Spam in Hyperlinked Databases - A computer-implemented method identifies nodes that are beneficiaries of node importance inflating links in a directed graph of linked nodes. The directed graph of linked nodes corresponds to a linked database, and the nodes correspond to documents within the linked database. The method is performed by a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the method. The method includes computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function, and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node. | 11-03-2011 |
20110320500 | SYSTEM AND METHOD FOR CONSTRUCTING A UNIVERSITY MODEL GRAPH - An educational institution (also referred as a university) is rich with multiple kinds of data: students, faculty members, departments, divisions, and at university level. Relating and correlating this data at and across various levels help in obtaining a perspective about the educational institution. A structural representation captures the essence of all of the relationships in a unified manner and an important aspect of the relationship is the so-called “influence factor.” This factor indicates influencing effect of an entity over another entity, wherein the entities are a part of the structural representation. A system and method for the construction of such a structural representation of an educational institution based on the educational institution specific information is discussed. | 12-29-2011 |
20120005236 | Cloud Services Creation Based on Graph Mapping - 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. | 01-05-2012 |
20120005237 | METHOD AND SYSTEM FOR BUILDING A STREAMING MODEL - A method of constructing a plurality of downloadable files from an application file and a plurality of transcripts. The application file stores data blocks and implements an application. Each of the transcripts stores at least one order in which at least a portion of the data blocks of the application file were accessed by the application when executed previously. The transcripts are combined into a combined transcript storing at least one combined order comprising a combined portion of the data blocks. The data blocks of the combined portion are arranged in a data structure having an origin. A first set of data blocks within a predetermined distance from the origin is stored in at least one initial execution file. A second set of data blocks outside the predetermined distance from the origin is stored in downloadable sequence files. | 01-05-2012 |
20120005238 | MACHINE OPTIMIZATION DEVICES, METHODS, AND SYSTEMS - 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. | 01-05-2012 |
20120005239 | Method and Apparatus for Displaying Data Stored in Linked Nodes - A computer implemented method of storing, manipulating, assessing, and displaying data and its relationships, and a computer system (with memory) programmed to implement such method. The data is stored into nodes, and visualized as a sea of linked nodes. | 01-05-2012 |
20120023141 | SYSTEM AND METHOD FOR REPRESENTING, ORGANIZING, STORING AND RETRIEVING INFORMATION - A data structure for representing information as a binary directional graph comprising a set of points connected by three distinct types of directed edges. Each point must have a unique left (parenting) edge and a unique right (parenting) edge with end points, and an identity edge that can be null (i.e. have no end point). All connected paths of edges upwards eventually converge at a maximal point in the structure. The points are uniformly assigned a fixed set of data as their content. Rules are defined to construct the structure and allow representation of information, with methods described for translating conventional forms of representation, such as tables, properties, classes, relations, and functions. The structure can be represented as a single relation (i.e. a single table with a fixed structure) and can be implemented using a conventional relational database. | 01-26-2012 |
20120030245 | Multiple dimensioned database architecture supporting table groups - A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets. | 02-02-2012 |
20120030246 | Multiple dimensioned database architecture supporting operations on table groups - A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets. | 02-02-2012 |
20120078969 | SYSTEM AND METHOD TO EXTRACT MODELS FROM SEMI-STRUCTURED DOCUMENTS - Systems and associated methods for automated and semi-automated building of domain models for documents are described. Embodiments provide an approach to discover an information model by mining documentation about a particular domain captured in the documents. Embodiments classify the documents into one or more types corresponding to concepts using indicative words, identify candidate model elements (concepts) for document types, identify relationships both within and across document types, and consolidate and learn a global model for the domain. | 03-29-2012 |
20120096042 | USER QUERY REFORMULATION USING RANDOM WALKS - There is provided a computer-implemented method for user query reformulation. A graph is created to represent a relationship between previous user query terms. The graph may represent the previous user searches in n-grams that correspond to nodes. A random walk analysis is performed to determine probabilities that various n-grams corresponding to nodes of the graph could be used to effectively alter a user search term. The probabilities represent a quantification of relationships between nodes of the graph. A determination may be made regarding whether to reformulate the user query based on a relationship between a user search term in the user query and a graphed search term represented by a node of the graph. The determination takes into account a relationship between the user search term and the graphed search term. | 04-19-2012 |
20120096043 | DATA GRAPH CLOUD SYSTEM AND METHOD - A computer-implemented method for managing updates for a node in a graph is described. An update relating to a node is received. The update is written to a graph database file system. A node update message is broadcast to at least one graph server when the update includes a change to a characteristic of the node. | 04-19-2012 |
20120143921 | SYSTEMS AND METHODS FOR MANAGING SOCIAL NETWORKS BASED UPON PREDETERMINED OBJECTIVES - 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. | 06-07-2012 |
20120158791 | FEATURE VECTOR CONSTRUCTION - Feature vector construction techniques are described. In one or more implementations, an input is received at a computing device that describes a graph query that specifies one of a plurality of entities to be used to query a knowledge base graph that represents the plurality of entities. A feature vector is constructed, by the computing device, having a number of indicator variables, each of which indicates observance of a sub-graph feature represented by a respective indicator variable in the knowledge base graph. | 06-21-2012 |
20120179726 | FLOW ANALYSIS INSTRUMENTATION - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for flow analysis. In one aspect, a method includes modifying a dataflow graph, the dataflow graph including a plurality of paths connecting at least one entry point and at least one exit point, including adding components to the dataflow graph that add flow units to data records and remove flow units from data records, each flow unit identifying a segment of a path traversed by the data record. The method also includes identifying execution paths based on flow units obtained by processing a plurality of data records using the modified dataflow graph. The method also includes determining a subset of the plurality of data records, wherein a selected set of execution paths are represented by the subset. | 07-12-2012 |
20120197944 | SYSTEM AND METHOD FOR DETERMINING AN OBJECT'S LIFETIME IN AN OBJECT ORIENTED ENVIRONMENT - A system and method determines an object's lifetime. An object lifecycle engine may work with an object oriented environment. As objects are created, an object graph may be constructed having one or more roots. A root record graph may be constructed, and edges of the root record graph may point in an opposite direction than the edges of the object graph. As objects, entities, and references are added, removed, or deleted from within the environment, the object graph and the root record graph may be updated. A root finder may search the root record graph to determine whether a given root record is no longer rooted. If a root record is no longer rooted, then the object associated with that root record may be determined to be unreachable and at the end of its lifetime. If the root finder search is performed when references are removed, then objects may be destroyed in a deterministic manner. | 08-02-2012 |
20120209886 | SYSTEM AND METHOD FOR CREATING, DEPLOYING, INTEGRATING, AND DISTRIBUTING - In a computer environment, a system and method is described that generally provides for creation of a distributed graph database, creation and deployment of nodes in a distributed graph database system, and integration of nodes into a set of distributed graph databases that include data nodes and edges that are: entities built using forms, relations, and relationships; immutable but evolvable through the addition of new data nodes or new edges joining the evolving data node to another data node; shareable and mergeable. | 08-16-2012 |
20120226717 | CONFIGURATION MANAGEMENT VISUALIZATION - Embodiments herein include systems, methods, software, and data structures to generate and render visualizations of configuration items (CIs) represented in a Configuration Management Database (CMDB). One embodiment includes receiving a request for a CI graph from a client including a focus CI identifier represented in a CMDB. The focus CI may be used to retrieve data of related CIs, the data including CI identifiers. A process is then executed for each retrieved CI identifier to retrieve CI data as a function of the received CI identifier and to build a node XML and an edge XML representation of relations between the CIs. This method also includes aggregating the node and edge XML representations into a single XML document and then translating the document into a markup language document capable of being rendered in a graphical user interface. The markup language document is then transmitted to the requestor. | 09-06-2012 |
20120259895 | Converting Video Metadata to Propositional Graphs for Use in an Analogical Reasoning System - An automatic approach is described for the semantic analysis and conversion of video annotation metadata (e.g., Video Event Markup Language or “VEML” metadata) to propositional graphs suitable for analysis by an analogical reasoning system (ARS). Also as described herein, a system architecture implements this conversion while maintaining semantic consistency from annotation through results reporting. Further, the techniques herein leverage the same ontology to populate options for an annotation tool, provide the rules for the metadata-to-propositional graph mapping, and provide the basis for comparison in an analogical reasoning algorithm. | 10-11-2012 |
20120259896 | System and Method of Optimizing Performance of Schema Matching - In one embodiment the present invention includes a computer-implemented method of improving performance of schema matching. The method includes storing a matching topology that maps a first data structure to a second data structure. The method further includes identifying a first portion of the matching topology that is a candidate for improvement as determined according to an incidence graph. The method further includes rewriting the first portion of the matching topology with a second portion according to the incidence graph. | 10-11-2012 |
20120265788 | Longitudinal Electronic Record System and Method With Problem Determination and Plan Ordering - A system and method for keeping, organizing and managing electronic records, comprising generating a first instance of data objects comprising data elements during a first encounter, the elements comprising a first instance identifier and temporal identifiers; linking a data object to a summarization reference with a pointer; creating an additional instance of data objects also comprising data elements comprising an additional instance identifier and temporal identifiers during a later encounter; and providing continuity for the first instance data objects over time. Continuity may be provided by tracking a relationship between the first instance data object and an additional instance data object and repointing the pointer to point between the summarization reference and the additional instance data object. The additional instance data object may be a revision of the first instance data object, and tracking may occur by back-linking the revision to the first instance data object. | 10-18-2012 |
20120271860 | USER DATA STORE - A computer system for generating a user data store and analyzing the user data store comprises a memory and a processing circuit. The memory is configured to store a user data store comprising a plurality of graphs, each graph having a user identity node. The processing circuit is configured to, for each of the plurality of graphs: receive asset data representing an asset that a user has interacted with on a website; generate a first node representing the asset data and a first link coupling the first node to the user identity node of the graph; store the first node and first link as part of the graph; receive usage data representing user interaction with a website; generate a second node representing the usage data and a second link coupling the second node to the user identity node of the graph, wherein at least one of the first node and second node further represents opinion data for a product or evaluation data for a product; and store the second node and second link as part of the graph. | 10-25-2012 |
20120278365 | GRAPH DATABASES FOR STORING MULTIDIMENSIONAL MODELS OF SOFTWQARE OFFERINGS - The disclosed embodiments provide a system that facilitates the maintenance and execution of a software offering. During operation, the system obtains model data associated with a multidimensional model of the software offering. Next, the system stores the model data in a graph database. Finally, the system uses the graph database to facilitate management of the software offering. | 11-01-2012 |
20120296940 | DOCUMENT ANALYSIS, COMMENTING, AND REPORTING SYSTEM - A method includes identifying a document structure instance that includes structure components. A selected structure component is chosen from the structure components. The method includes generating, with a processor, a hierarchical graph based on the selected structure component. The hierarchical graph includes classes, a class definition relationship, and an instance identifier that identifies the selected structure component. The hierarchical graph is output. | 11-22-2012 |
20120317149 | METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS - Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed. | 12-13-2012 |
20120331008 | SAMPLING THE SPACE OF ANCESTRAL RECOMBINATION GRAPHS - A method is provided for constructing an ancestral recombination graph. A value K is received representing K extant units. M non-mixing segments are also received. K vertices V are generated. K lineages for each of M trees are associated with each of the K vertices. An ancestral recombination graph is constructed. To construct the ancestral recombination graph, there is repeated, until only one lineage survives for each of the M trees, a process that includes the following. A tree is randomly selected tree. A first vertex v | 12-27-2012 |
20130024479 | METHODS AND SYSTEMS FOR PROCESSING LARGE GRAPHS USING DENSITY-BASED PROCESSES USING MAP-REDUCE - Embodiments are directed to a density-based clustering algorithm that decomposes and reformulates the DBSCAN algorithm to facilitate its performance on the Map-Reduce model. The DBSCAN algorithm is reformulated into connectivity problem using a density filter method and a partial connectivity detector. The density-based clustering algorithm uses message passing and edge adding to increase the speed of result merging, it also uses message mining techniques to further decrease the number of iterations to process the input graph. The algorithm is scalable, and can be accelerated by using more machines in a distributed computer network implementing the Map-Reduce program. | 01-24-2013 |
20130041924 | EVENT IMPACT ANALYSIS - A method and system for analyzing impact of an event on resources of a network. A directed graph is generated and includes nodes and edges. Each node represents a resource. Each edge connects, and is directed from, a predecessor node to a successor node. The event impacts the resource at an event node. A propagation time (PT) is determined for each edge. The PT is a time interval for an impact of the event to travel along each edge from the predecessor node to the successor node. An initial estimated impact time (EIT) is set for each node. The EIT for each node is an estimated time at which the event impacts each node. The EIT of each node that is directly or indirectly connected to the event node by one or more edges is updated. A list of the updated nodes is sent to an output device. | 02-14-2013 |
20130046795 | SYSTEM AND METHOD FOR THE CALCULATION AND USE OF TRAVEL TIMES IN SEARCH AND OTHER APPLICATIONS - A system and method are provided for generating travel sheds which show the area reachable in a given amount of time by different modes of transport. A travel shed may consist of a series of polygons or other geometric shapes showing areas reachable from a given address or location within a specified travel time utilizing a specified mode of transport (e.g. driving, biking, walking, public transportation, etc.). Techniques are disclosed for enabling rapid calculations of travel times. In one embodiment, rapid generation of travel times and associated travel sheds may be enabled by performing pre-processing steps (e.g. downsampling, progressive road type removal, etc.) on road graph data. The pre-processing steps reduce the road graph while still preserving enough to generate accurate travel sheds. One example use of travel sheds is to enable searching for points of interest (e.g. homes, apartments, hotels, restaurants, schools, parks, etc.) according to specified travel times. | 02-21-2013 |
20130080475 | Employee Profiler and Database - A system for generating statistics relating to recorded employee behavior, the system including: a first database of tasks performed by employees, the first database being stored on a computer-readable storage medium; a second database of actions taken by the employees while performing the tasks, the second database being stored on a computer-readable storage medium; and a software program, stored on a computer-readable storage medium, configured to extract information from the databases regarding the tasks performed by the employees as well as the actions performed by the employees while carrying out the tasks. The software program then calculates performance statistics relating to success or failure regarding a particular task. The software program furthermore sorts the employees into subgroups based on their status in the company and then calculates performance statistics for the subgroup to compare against individual performance within the subgroup. | 03-28-2013 |
20130080476 | SEARCH APPARATUS, SEARCH METHOD, AND COMPUTER READABLE MEDIUM - A search apparatus includes a graph memory, a root node specification receiving unit, and a search unit. The graph memory stores data of a graph having nodes representing data elements and a link representing a relationship between the data elements. The root node specification receiving unit receives a root node specified from among the nodes in the graph. The search unit searches for an adjacent node which is connected to a target node via a link and which satisfies a search condition that at least one of the target node and the adjacent node has a predetermined attribute. The search unit searches for an adjacent node using the root node as the target node. The search unit iteratively performs a process of searching for an adjacent node using a previously determined adjacent node as the target node for a subsequent iteration to obtain a concatenation of adjacent nodes. | 03-28-2013 |
20130103719 | INTERACTIVE VISUALIZATION OF TEMPORAL EVENT DATA AND CORRELATED OUTCOMES - Methods and apparatus are provided for interactive visualization of temporal event data and correlated outcomes. The temporal event data comprises a plurality of entities undergoing one or more events. The temporal event data is aggregated and a flow graph is generated to represent the aggregated temporal event data. The flow graph comprises a directed acyclic graph having a plurality of nodes connected by edges, wherein each of the nodes represents a group of entities in a given state. A view of the flow graph is generated and then a visualization of the flow graph view can be rendered to a user. The user can interact with the flow graph view and the visualization and/or the flow graph view can be updated based on the user interactions. The flow graph is sliced into layers, wherein a given layer i contains all nodes with i events. | 04-25-2013 |
20130103720 | Systems and Methods For Providing For Display A Map That Graphically Represents The Association Among Documents - Systems and methods for providing for display a map that graphically represents the association among documents are disclosed. A method for providing for display a map that graphically represents the association between a first document and a second document that analyzes the first document includes receiving, at a computer, a request to generate the map. The method further includes retrieving, from a database, analysis information related to the way in which the second document analyzed the first document, in response to the received request. The method further includes providing for display the map. The map includes a first node, a second node, and a connector. The first node corresponds to the first document. The second node corresponds to the second document. The connector graphically links the first node and the second node. The second node includes a graphical representation of the analysis information. | 04-25-2013 |
20130117326 | EXTERNAL SERIALIZATION AND DESERIALIZATION - An object graph can be transformed from a first form to a second form based on metadata discovered about objects of the object graph external to a corresponding object model. In one instance, transformation can correspond to serialization and deserialization. | 05-09-2013 |
20130124572 | Media generation and management - Techniques for media generation and management are described, including retrieving data associated with an asset, processing the data to identify an asset type, the asset type and the data being used to configure an application framework, wherein one or more panels are dynamically determined by evaluating the asset type, the one or more panels being presented in the application framework and at least one of the one or more panels are configured to receive an input initiating an action performed on the asset, and presenting the asset and the one or more panels in an interface coupled to the application framework. | 05-16-2013 |
20130124573 | DEEP CLONING OF OBJECTS USING BINARY FORMAT - 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. | 05-16-2013 |
20130124574 | SCENARIO DRIVEN DATA MODELLING: A METHOD FOR INTEGRATING DIVERSE SOURCES OF DATA AND DATA STREAMS - A system and method of integrating diverse sources of data and data streams is presented. The method can include selecting a scenario based on a topic, creating a multi-relational directed graph based on the scenario, identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the resources, identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds, identifying analytical routines in accordance with the scenario and updating the multi-directed graph using the analytical routines and identifying data outputs in accordance with the scenario and defining queries to produce the data outputs from the multi-directed graph. | 05-16-2013 |
20130132442 | ONTOLOGY CONSTRUCTION - Disclosed are methods in which ontologies are automatically (i.e., with little or no human interaction) constructed from data. The constructed ontology may be provided for use by an application or device. An ontology may be constructed as follows. Firstly, a lexical graph is constructed. Secondly, a concept-detection process is performed on the lexical graph to detect concepts (prominent terms) in the lexical graph. Thirdly, a clustering method is performed on the lexical graph to form groups of concepts. Fourthly, relationships between the concepts are determined based on the interconnections of the concepts in the groups. Lastly, the concepts and detected relationships therebetween are structured using a formal ontology specification. | 05-23-2013 |
20130138699 | MANAGING ADAPTER ASSOCIATION FOR A DATA GRAPH OF DATA OBJECTS - The present invention provides a method, system, and program product for managing adapter association for a data graph of data objects. Specifically, under the present invention, a data graph of data objects is generated (e.g., on a server), and then serialized. In performing the serialization, the data graph is translated into bits. In one embodiment, the bits are communicated to a client over a network, and then translated back into the data graph (i.e., deserialized). An adapter is associated with each of the data objects after the data graph is deserialized. This avoids the “overhead” involved with associating and having active adapters during deserialization. | 05-30-2013 |
20130166601 | SYSTEMS AND METHODS FOR CONDUCTING RELIABLE ASSESSMENTS WITH CONNECTIVITY INFORMATION - Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested, calculated, or assigned from third parties or based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph within the network community, or the degree of trust. Social graph data analytics may be used to determine a network connectivity value from all or a subset of all of the retrieved paths and/or one or more connectivity statistics value associated with the first node and/or the second node. A parallel computational framework may operate in connection with a key-value store to perform some or all of the computations related to the connectivity determinations. | 06-27-2013 |
20130173666 | TECHNIQUES FOR DATA ASSIGNMENT FROM AN EXTERNAL DISTRIBUTED FILE SYSTEM TO A DATABASE MANAGEMENT SYSTEM - 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. | 07-04-2013 |
20130173667 | ACYCLIC GRAPH NAVIGATOR - A method for navigating an acyclic graph includes the steps of generating two or more acyclic graphs, each of the two or more acyclic graphs relating to a specific topology, wherein at least two of the two or more acyclic graphs include at least one common node; receiving a request to generate a composite acyclic graph, wherein the composite acyclic graph includes the at least one common node; generating the composite acyclic graph; and displaying the specific node of the composite acyclic graph. | 07-04-2013 |
20130198240 | Social Network Analysis - A computer-implemented method for analysing user traffic at a website that includes an article on at least one page, wherein the or each page includes a file stored at a website file server, the method comprising determining a set of topics for the article by computing respective measures for the probabilities of keywords appearing in the article, generating a graph representing actions performed on the article by a user, determining a set of shortest paths between respective ones of nodes of the graph, and computing a statistical measure for user traffic at the website. | 08-01-2013 |
20130212131 | SYMBOLIC HYPER-GRAPH DATABASE - A graph database is described. The graph database includes one or more symbolic data stores and one or more key-value data stores. Each symbolic data store is configured to symbolically store sets of multiple hyper-graph nodes. Each key-value data store is configured to store attribute information for hyper-graph nodes and hyper-graph edges. | 08-15-2013 |
20130218928 | INFORMATION PROCESSING DEVICE - An information processing device is connected to a database storing graph data having been generated by analysis engines and having a data structure that plural nodes are connected, and includes: a node information database which is set for each of the graph data compatible with the respective analysis engines and in which, with path information referring to a node in the graph data, identification information that is information for identifying the node and that is identical for identical nodes is associated; and a data processing means for, based on the node information database, executing a process of associating a node in the graph data having a predetermined data structure generated by a predetermined analysis engine and a node in the graph data generated by another analysis engine associated with identical identification information to the identification information associated with the node in the graph data having the predetermined data structure. | 08-22-2013 |
20130232174 | Highlighting of Time Series Data on Force Directed Graph - A force directed graph may display recent activities of a message passing system as highlighted features over a larger graph. The force directed graph may display a superset of nodes and edges representing processes and message routes, then display recent activities as highlighted elements within the larger superset. The highlighted elements may display messages passed or computation performed during a recent time element of a time series. In some embodiments, the effects of activities may be displayed by decaying the highlighted visual elements over time. | 09-05-2013 |
20130238666 | MERGING AND IGNORING CONFIGURATION ITEMS - Aspects of the present disclosure provide techniques that determine whether each configuration item in a plurality of configuration items is associated with every other configuration item therein. If each configuration item in the plurality of configuration items is associated with every other configuration item therein, the plurality of configuration items are merged such that each attribute associated therewith is associated with one configuration item. If each configuration item in the plurality of configuration items is not associated with every other configuration item therein, it is determined whether at least one configuration item may be ignored. | 09-12-2013 |
20130238667 | DATABASE, APPARATUS, AND METHOD FOR STORING ENCODED TRIPLES - Embodiments of the present invention provide a database of graph data encoded as triples, each comprising a subject, a predicate, and an object, and each stored within a data item among a set of data items ordered according to their data and distributed across a plurality of nodes of a distributed network of nodes; wherein the node to which each of the data items is mapped is dependent upon the position of the data item within the ordered set; and each triple is stored in two or more data items each having a different configuration from among the following:
| 09-12-2013 |
20130262518 | Deterministic Finite Automata Graph Traversal With Nodal Bit Mapping - 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. | 10-03-2013 |
20130268565 | Traversal Based Directed Graph Compaction - 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. | 10-10-2013 |
20130282764 | METHOD AND SYSTEM FOR BUILDING A STREAMING MODEL - A method of constructing a plurality of downloadable files from an application file and a plurality of transcripts. The application file stores data blocks and implements an application. Each of the transcripts stores at least one order in which at least a portion of the data blocks of the application file were accessed by the application when executed previously. The transcripts are combined into a combined transcript storing at least one combined order comprising a combined portion of the data blocks. The data blocks of the combined portion are arranged in a data structure having an origin. A first set of data blocks within a predetermined distance from the origin is stored in at least one initial execution file. A second set of data blocks outside the predetermined distance from the origin is stored in downloadable sequence files. | 10-24-2013 |
20130311516 | SYSTEMS AND METHODS FOR PROVIDING ENTERPRISE VISUAL COMMUNICATIONS SERVICES - Embodiments include systems and methods for providing enterprise visual communications. In one embodiment, a method is provided. The method can include receiving event data from one or more data management systems; based at least in part on the received event data, generating one or more indications for output to a user; based at least in part on the received event data, generating one more expected activities for the user; and generating one or more additional indications corresponding with at least one of the expected activities for output to the user. | 11-21-2013 |
20130311517 | Representing Incomplete and Uncertain Information in Graph Data - A method for representing and querying incomplete and uncertain information in graph data receives a plurality of graphs containing subject nodes, object nodes and predicates extending between subject and object nodes. The subject nodes and predicates can be URIs or blank, and the object nodes can be URIs, literals or blank. Incomplete graph data sets are created by a variable into each blank subject node, each blank predicate and each blank object node, and uncertain graph data sets are created by substituting alternative values for all variables in the incomplete data graph. A query is received from a user and a naïve search of the graph data is performed for certain data. The incomplete and uncertain graphs are then used to determine potential answers and certain potential answers based on user-specified requirements. The certain answers and potential certain answers are returned to the user. | 11-21-2013 |
20130332490 | Method, Controller, Program and Data Storage System for Performing Reconciliation Processing - A method, program, and data storage system for performing reconciliation of resources represented in a graph of data as nodes, comprising selecting an initial subset of the nodes of the graph for which reconciliation processing with a particular node is to be carried out, performing reconciliation processing between the particular node and each of the initial subset of nodes, and delaying reconciliation processing between the particular node and a further subset of the nodes of the graph for which reconciliation with the particular node is to be carried out. | 12-12-2013 |
20140012884 | OPTIMIZING SPARSE SCHEMA-LESS DATA IN DATA STORES - 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. | 01-09-2014 |
20140019490 | EVENT PROCESSING FOR GRAPH-STRUCTURED DATA - 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. | 01-16-2014 |
20140032606 | COLLAPSIBLE GROUPS IN GRAPHICAL WORKFLOW MODELS - 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. | 01-30-2014 |
20140032607 | Content Search Mechanism That Uses A Deterministic Finite Automata (DFA) Graph, A DFA State Machine, And A Walker Process - 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. | 01-30-2014 |
20140046981 | CONTEXT-BASED GRAPHICAL DATABASE - 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. | 02-13-2014 |
20140046982 | MANAGING CROSS-CORRELATED DATA - 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. | 02-13-2014 |
20140046983 | Data Analysis - 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. | 02-13-2014 |
20140059083 | CONTEXT-BASED SEARCH FOR A DATA STORE RELATED TO A GRAPH NODE - 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. | 02-27-2014 |
20140059084 | CONTEXT-BASED GRAPH-RELATIONAL INTERSECT DERIVED DATABASE - 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. | 02-27-2014 |
20140067873 | EFFICIENT EGONET COMPUTATION IN A WEIGHTED DIRECTED GRAPH - 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. | 03-06-2014 |
20140074893 | Activity Based Recommendations within a Social Networking Environment Based Upon Graph Activation - 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. | 03-13-2014 |
20140089351 | HANDLING OUT-OF-SEQUENCE DATA IN A STREAMING ENVIRONMENT - 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. | 03-27-2014 |
20140089352 | HANDLING OUT-OF-SEQUENCE DATA IN A STREAMING ENVIRONMENT - 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. | 03-27-2014 |
20140115010 | PROPAGATING INFORMATION THROUGH NETWORKS - 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. The method further comprises using the pre-normalized weights and influence factors as a set of linear constraints to determine final label weightings for the entity nodes. | 04-24-2014 |
20140143280 | Scalable Summarization of Data Graphs - Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently. | 05-22-2014 |
20140143281 | Scalable Summarization of Data Graphs - Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently. | 05-22-2014 |
20140149465 | FEATURE RICH VIEW OF AN ENTITY SUBGRAPH - A data processing system employs a pre-processing step to create a simplified view of a received entity graph. During the pre-processing step, only the objects and the attributes of those objects within the graph that are required for data processing are selected. Pruned source and target objects are generated by omitting those attributes that are not required for processing. The pruned objects are included in the simplified view that enhances system performance. | 05-29-2014 |
20140156707 | STREAMING SYSTEM PERFORMANCE OPTIMIZATION - According to an example, a dataflow directed acyclic graph including nodes and edges connecting the nodes. Parameters for the nodes are calculated, and the parameters may include batch size and a degree of parallelism. | 06-05-2014 |
20140172920 | SYSTEM AND METHOD OF DETERMINING COMPLEXITY OF COLLABORATIVE EFFORT - A method of determining the complexity of a collaborative effort which method includes receiving data via a processor, the data including identities of social actors or sets of social actors in the collaborative effort, and storing the data in a repository accessible by the processor; defining nodes, via the processor, and associating the nodes with each of the social actors of or with each of the sets of social actors in the collaborative effort to define nodes that represent each of the social actors or each of the sets of social actors; identifying, via the processor, one or more dimensions for each social actor; defining a coordination complexity (G), via the processor, and determining, for each dimension, a sum of a difference between every two of the nodes, multiplying the sum by a weight specific for that dimension, and adding each of the multiplied sums for each dimension. In another aspect, the invention includes a system of determining complexity of a collaborative effort. | 06-19-2014 |
20140188941 | Using a Graph Database to Match Entities by Evaluating Boolean Expressions - A method of matching a first entity to a second entity by evaluating Boolean expressions includes identifying a set of criteria vertices for a second entity vertex by traversing a graph database in a manner constrained to fact vertices identified for the second entity. The graph database relates fact vertices to the criteria vertices by edges corresponding to Boolean expressions for satisfying criteria for matching first entities to second entities. The method additionally includes selecting one of the first entities based on the criteria vertices of the set. The method further includes matching the first entity to the second entity based on the selection. | 07-03-2014 |
20140222871 | TECHNIQUES FOR DATA ASSIGNMENT FROM AN EXTERNAL DISTRIBUTED FILE SYSTEM TO A DATABASE MANAGEMENT SYSTEM - 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. | 08-07-2014 |
20140280358 | MACHINE FOR RECOGNIZING OR GENERATING JABBA-TYPE SEQUENCES - Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more computing devices to facilitate or otherwise support one or more processes or operations for a machine for recognizing or generating one or more Jabba-type sequences. | 09-18-2014 |
20140280359 | COMPUTING SYSTEM WITH SOCIAL INTERACTION MECHANISM AND METHOD OF OPERATION THEREOF - A computing system includes: a control unit configured to: detect an upcoming event for interacting with a focal person for the upcoming event; extract an invitee's identification for the upcoming event, aggregate an invitee's information associated with the invitee's identification; build a social graph as an enhanced graph or with an extension graph based on the invitee's information for adding an invitee associated with the invitee's identification; and a storage unit, coupled to the control unit, configured to store the social graph. | 09-18-2014 |
20140280360 | GRAPH DATABASE DEVICES AND METHODS FOR PARTITIONING GRAPHS - A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method. | 09-18-2014 |
20140280361 | Data Analysis Computer System and Method Employing Local to Global Causal Discovery - Discovery of causal networks is essential for understanding and manipulating complex systems in numerous data analysis application domains. Several methods have been proposed in the last two decades for solving this problem. The inventive method uses local causal discovery methods for global causal network learning in a divide-and-conquer fashion. The usefulness of the invention is demonstrated in data capturing characteristics of several domains. The inventive method outputs more accurate networks compared to other discovery approaches. | 09-18-2014 |
20140280362 | SYSTEM AND METHOD FOR CREATING, DEPLOYING, INTEGRATING, AND DISTRIBUTING NODES IN A GRID OF DISTRIBUTED GRAPH DATABASES - In a computer environment, a system and method is described that generally provides for creation of a distributed graph database, creation and deployment of nodes in a distributed graph database system, and integration of nodes into a set of distributed graph databases that include data nodes and edges that are: entities built using forms, relations, and relationships; immutable but evolvable through the addition of new data nodes or new edges joining the evolving data node to another data node; shareable and mergeable. | 09-18-2014 |
20140289281 | SYSTEMS, METHODS, AND GRAPHICAL TOOLS FOR REPRESENTING CONNECTEDNESS OF INDIVIDUALS - 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. | 09-25-2014 |
20140297690 | INFORMATION PROCESSING TECHNIQUE FOR GRAPH INCLUDING NODES - 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. | 10-02-2014 |
20140317148 | RECONFIGURING AN OPERATOR GRAPH BASED ON ATTRIBUTE USAGE - 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. | 10-23-2014 |
20140337387 | Content Search Mechanism That Uses A Deterministic Finite Automata (DFA) Graph, A DFA State Machine, And A Walker Process - 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. | 11-13-2014 |
20140351289 | SIMPLIFICATION OF LARGE NETWORKS AND GRAPHS - 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. | 11-27-2014 |
20140351290 | CALCULATING NODE CENTRALITIES IN LARGE NETWORKS AND GRAPHS - 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. | 11-27-2014 |
20140365531 | CREATION OF A GRAPH DATABASE OF A VIRTUALIZATION INFRASTRUCTURE - 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. | 12-11-2014 |
20150019592 | SYSTEMS, METHODS AND SOFTWARE FOR COMPUTING REACHABILITY IN LARGE GRAPHS - 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. | 01-15-2015 |
20150026217 | DATA OUTPUT METHOD, COMPUTER-READABLE RECORDING MEDIUM STORING DATA OUTPUT PROGRAM AND DATA OUTPUT SYSTEM - 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. | 01-22-2015 |
20150032777 | CANONICAL DATA MODEL FOR ITERATIVE EFFORT REDUCTION IN BUSINESS-TO-BUSINESS SCHEMA INTEGRATION - 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. One computer-implemented method includes receiving the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory, processing, using a computer, the source hierarchical schemas to generate a merged graph, the merged graph 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, and determining, using the computer, that the merged graph includes one or more conflicts and, in response, resolving each conflict of the one or more conflicts to generate a computed-transitive-edge-free, conflict-free merged graph as a unified data model (UDM), wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes. | 01-29-2015 |
20150046496 | METHOD AND SYSTEM OF GENERATING AN IMPLICIT SOCIAL GRAPH FROM BIORESPONSE DATA - 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. | 02-12-2015 |
20150052175 | Method and Apparatus for Identifying the Optimal Schema to Store Graph Data in a Relational Store - 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. | 02-19-2015 |
20150066989 | GRAPH DATABASE WITH ONE OR MORE INFRASTRUCTURE IMPARTED ASPECTS - 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. | 03-05-2015 |
20150066990 | SYSTEMS AND METHODS FOR DISCOVERING TEMPORAL PATTERNS IN TIME VARIANT BIPARTITE GRAPHS - 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). | 03-05-2015 |
20150066991 | Traversal With Arc Configuration Information - 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. | 03-05-2015 |
20150074148 | Systems and Methods for Managing Social Networks Based Upon Predetermined Objectives - 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. | 03-12-2015 |
20150081741 | INCREMENTAL GRAPH VIEW MAINTENANCE - Enclosed herein are systems, methods, and software to facilitate incremental graph view maintenance in a data system. In one example, a method of operating a graph maintenance module to implement graph view maintenance on a graph view based on a relational database includes identifying a modification to the relational database. The method further includes, identifying a graph modification for the graph view based on the modification to the relational database, and implementing the graph modification in the graph view. | 03-19-2015 |
20150100605 | DETERMINING COLLECTION MEMBERSHIP IN A DATA GRAPH - An efficient system for evaluating collection membership in a large data graph. The system includes a data graph of nodes connected by edges and an index of constraints from collection definitions, a definition specifying at least one condition with at least one constraint, where a constraint has a constraint type and a constraint expression. Multiple conditions in the definition may be conjunctive. The system may also include instructions that, when executed by the at least one processor, cause the system to: evaluate an edge for a node in the data graph against the index to determine conditions met by the edge and its associated neighborhood, repeat the evaluating for each edge associated with the node in the data graph, determine that conditions for a first collection are met, and generate an indication in the data graph that the node is a member of the first collection. | 04-09-2015 |
20150113024 | GENERATING SOCIAL GRAPHS USING COINCIDENT GEOLOCATION DATA - The present disclosure provides a method and a system for generating social graphs using coincident geolocation data. In particular, a method is provided in which an entity retrieves information from one or more databases. The information includes geolocation data for a plurality of entities generated over a predetermined period of time. The information is analyzed to determine coincident geolocation information of the entities. The coincident geolocation information is then analyzed to determine social relationships of the entities. One or more social graphs are then generated based on the social relationships of the entities. The social graphs comprise multi-node graphs having edges or connectors linking the nodes. The entities are represented by the nodes. A social relationship between the entities is represented by the edges or connectors linking the nodes. The attributes of the edges or connectors are based upon information describing a characteristic of the relationship. | 04-23-2015 |
20150120782 | Systems and Methods for Identifying Influencers and Their Communities in a Social Data Network - A system and method performed by a server for determining at least one user account that is influential for a topic: obtaining the topic; determining a plurality of user accounts within a social data network that are related to the topic; representing each of the user accounts as a node in a connected graph and determining an existence of a relationship between each of the user accounts; computing a topic network graph using each of the user accounts as nodes and the corresponding relationships as edges between each of the nodes; ranking the user accounts within the topic network graph to filter outlier nodes within the topic network graph; identifying at least two distinct communities amongst the user accounts within the filtered topic network graph, each community associated with a subset of the user accounts; identifying attributes associated with each community; outputting each community associated with the corresponding attributes. | 04-30-2015 |
20150120783 | INTER-ENTITY CONNECTION MAPS - The technology disclosed relates to identifying connection maps between entities (persons and organizations) and generating so-called connection stories between them based on the connection maps. The connection stories are graphic and visual representations of the connection paths that present to entities topological and chronological aspects of their relationships with other entities. | 04-30-2015 |
20150142853 | RECONSTRUCTING DOCUMENTS FROM n-GRAM INFORMATION - A method for reconstruction includes providing a directed input graph generated from a set of n-grams and statistics for the n-grams, edges of the graph being joined through nodes of the graph. Each edge has an associated label and a multiplicity of at least one. Each of the n-grams in the set being represented by a respective one of the labels, whereby a Eulerian cycle through the graph traverses each edge the respective multiplicity of times. Reduction rules are applied iteratively to generate a refined graph which is both irreducible and equivalent to the input graph. Information is output based on the labels of the refined graph. | 05-21-2015 |
20150142854 | DEEP CLONING OF OBJECTS USING BINARY FORMAT - 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. | 05-21-2015 |
20150149507 | STREAM DATA MULTIPROCESSING METHOD - A query parser that converts query definition into a query graph and decides the execution order of operators is installed, a set of consecutive operators in the execution order is called a stage, the total of calculation costs of operators configuring each stage is called a calculation cost of the stage, the query graph is divided into multiple stages such that the calculation cost of each stage becomes a value less than a value dividing the total cost of all operators by the number of calculation cores, and each calculation core extracts tuples one by one from an input stream, and, when taking charge of and executing processing of the tuples from the entrance to exit of the query graph, before the execution of each stage, confirms whether processing of the stage is completed for a tuple previous to a charge tuple. | 05-28-2015 |
20150294026 | GRAPH REPRESENTATION OF PROPERTY LOOKUPS - An embodiment of an object property management system using a dataflow architecture that expresses an application data as a directed acyclic graph and propagates data through the graph in an ordered, predictable way based on connections between the graph nodes. In one embodiment, the object property management system uses proxy nodes to arrange a dynamic graph for property data propagation for nested properties to allow property relationships to automatically adjust based on changes to a property value within the hierarchy of the property path. | 10-15-2015 |
20150294027 | Fast Component Enumeration in Graphs with Implicit Edges - A method and system for graphical enumeration. The method includes creating an ordered set of vertices for a graph such that each vertex is associated with a corresponding index, and wherein each vertex in the ordered set of vertices includes information. A plurality of keys is created for defining the information. A plurality of lists of vertices is created, each of which is associated with a corresponding key such that vertices in a corresponding list include information associated with the corresponding key. For a first list of vertices, a least valued index is determined from a group of associated vertices based on vertices in the first list and vertices pointed to by the vertices in the first list. Also, all associated vertices are pointed to a root vertex associated with the least valued index. | 10-15-2015 |
20150294028 | Systems and Methods for Dynamic Construction of Entity Graphs - The present disclosure includes a system, method, and article of manufacture for generating an entity graph. The method may comprise determining a relationship between a first entity and a second entity based upon internal data, external data, and/or online data associated with the first entity, and generating the entity graph comprising at least two nodes and an edge connecting the at least two nodes. The method may further comprise, in various embodiments, tailoring marketing to the first entity based upon the entity graph, detecting fraud against the first entity based upon the entity graph, periodically updating the entity graph based upon new internal data and new online data, and/or adjusting the edge based upon a change in the relationship between the first entity and the second entity. | 10-15-2015 |
20150310129 | METHOD OF MANAGING DATABASE, MANAGEMENT COMPUTER AND STORAGE MEDIUM - The present invention is a method of managing a database, which manages a graph database and a relational database on a computer provided with a processor and memory, wherein the computer acquires frequency of reference for each type of node of a graph database, extracts types of nodes for which the reference frequency is greater than or equal to a threshold, converts the extracted nodes to a table structure, and then retains the same as an intermediate table, and upon receiving an inquiry by the relational database, references the intermediate table. | 10-29-2015 |
20150317408 | APPARATUS AND METHOD FOR WEB PAGE ACCESS - An apparatus and method for web page access and an apparatus and method for structuring a web page access history are provided. The apparatus for structuring a web page access history includes a topic extractor configured to analyze a web page accessed by a user to extract at least one topic related to the page, a mapper configured to map the at least one extracted topic onto a node of an ontology-based data structure, and a summary graph generator configured to extract a sub graph including the mapped node from the data structure, and to generate a summary graph based on the extracted sub graph. | 11-05-2015 |
20150324404 | PROBABILISTICALLY FINDING THE CONNECTED COMPONENTS OF AN UNDIRECTED GRAPH - A method for probabilistically finding the connected components of an undirected graph. The method includes identifying a first edge, having a first and second vertex, and inserting information detailing the first and second vertex of the first edge into a bloom filter associated with a root node of a bloom filter data structure. A first node, connected to the root node, is created, comprising an associated bloom filter containing information associated with the first and second vertex of the first edge. The method includes identifying a second edge, having a first and second vertex, and inserting information detailing the first and second vertex of the second edge into a bloom filter associated with the root node of the bloom filter data structure. A second node, connected to the root node, is created, comprising an associated bloom filter containing information associated with the first and second vertex of the second edge. | 11-12-2015 |
20150324481 | Building Entity Relationship Networks from n-ary Relative Neighborhood Trees - Entities are objects with feature values that can be thought of as vectors in N-space, where N is the number of features. Similarity between any two entities can be calculated as a distance between the two entity vectors. A similarity network can be drawn between a set of entities based on connecting two entities that are relatively near to each other in N-space. Binary relative neighborhood trees are a special type of entity relationship network, designed to be useful in visualizing the entity space. They have the intuitively simple property that the more typical entities occur at the top of the tree and the more unusual entities occur at the leaf nodes. By limiting the number of links to n+1 per node (one parent, n children), a regularized flat tree structure is created that is much easier to visualize and navigate at both a course and a fine level by domain experts. | 11-12-2015 |
20150324482 | NETWORK GRAPH GENERATION METHOD AND DECISION-MAKING ASSISTANCE SYSTEM - A decision-making support system which is a client-server system comprising: multiple servers; a client having a display; a network; and a database. On the basis of data acquisition conditions supplied via the client the multiple servers acquire from the data base on multiple distributed processing platforms, a first data group spanning from the past to the present, and generate a first network graph for the time from the past to the present. The multiple servers also execute multiple simulations based on the first data group, on the basis of provided simulation conditions, and generate second and third network graphs for a time not included in the first data group or for the future. The client receives the results of the generation of these network graphs and displays on the display the first through third network graphs spanning from the past to the present, and to the future, thereby providing the user with a scenario map. | 11-12-2015 |
20150339381 | CONTENT RECOMMENDATIONS - Users consume a wide variety of content from various sources, such as videos accessible through websites. As provided herein, content recommendations that are contextually and/or semantically relevant to current content consumed by a user may be identified and provided to the user. For example, metadata for a video being watched by the user may be identified (e.g., terms extracted from a description, user reviews, a category, and/or other information). The metadata may be used to identify content recommendations based upon the metadata corresponding to terms grouped into a set of refined topic groupings of a graph comprising terms and relationships between terms extracted from a content corpus. The metadata may be matched to relevant terms within the set of refined topic groupings, and content recommendations comprising content corresponding to the relevant terms may be suggested to the user. | 11-26-2015 |
20150347421 | GRAPH DATABASE FOR A CONTACT CENTER - A graph database is described for use in connection with a contact center. The graph database includes a plurality of nodes and relationships that describe the operations, entities, personnel, and attributes in the contact center. The graph database enables previously discrete contact center components such as work assignment components, reporting components, work force management components, forecasting components, and the like to operate in a seamless and integrated manner. | 12-03-2015 |
20150347473 | DATABASE PARTITION - A method for partitioning a database includes obtaining business dependency between data in a plurality of tables in the database on the basis of a business process associated with the database; generating, on the basis of the business dependency, a dependency graph describing a dependency relationship between the plurality of tables; cutting the dependency graph into at least two sub-graphs; and vertically partitioning the database into at least two parts corresponding to the at least two sub-graphs respectively. | 12-03-2015 |
20150347625 | ESTIMATING INFLUENCE USING SKETCHES - A graph that includes multiple nodes and edges is received. Multiple instances of the graph are generated by randomly instantiating the edges according to either a binary independent cascade model or a randomized edge length independent cascade model. Where the binary independent cascade model is used, combined reachability sketches are generated for each node across all instances of the graph. Where the randomized edge length independent cascade model is used, combined all-distances sketches are generated for each node across all instances of the graph. Depending on which model is used, the combined reachability or all-distances sketches are used to estimate the influence of nodes in the graph or to estimate a subset of nodes from a graph of a specified size with a maximum influence using a greedy algorithm. | 12-03-2015 |
20150356200 | Composite Cognitive Insights - A method for providing composite cognitive insights comprising receiving streams of data from a plurality of data sources; processing the streams of data from the plurality of data sources, the processing the streams of data from the plurality of data sources performing data enriching and generating a sub-graph for incorporation into a cognitive graph; processing the cognitive graph, the processing the cognitive graph providing a plurality of individual cognitive insights; and, generating a composite cognitive insight, the composite cognitive insight being composed of the plurality of individual cognitive insights. | 12-10-2015 |
20150363511 | UTILIZING REFERENCE/ID LINKING IN XML WRAPPER CODE GENERATION - Utilizing reference/identification (ID) linking in extensible markup language (XML) wrapper code generation in a data processing system. A code generator receives a type document and reference/ID constraints document and accesses the reference/ID constraints document to translate between XML structures and object structures. | 12-17-2015 |
20150370919 | GRAPH TRAVELSAL OPERATOR AND EXTENSIBLE FRAMEWORK INSIDE A COLUMN STORE - A system, computer-implemented method, and a computer-readable storage medium for a traversal of a property graph, are provided. The edge table of the property graph is divided into a plurality of fragments. A first fragment is selected for traversal using a set of selected vertices, where the traversal identifies a set of edges. Based on the set of edges, a set of adjacent vertices is determined during the traversal. A set of discovered vertices in the property graph is determined based on the set of selected vertices and the set of adjacent vertices. | 12-24-2015 |
20150379158 | SYSTEMS AND METHODS FOR PATTERN MATCHING AND RELATIONSHIP DISCOVERY - Methods and systems for pattern matching and relationship discovery in graphs. The graph may be adapted as an actor graph, where vertices may include processing functionality and executable logic. The vertices of an actor graph may send messages to other vertices to which they are connected. A first vertex may receive an initial regular expression. The first vertex may evaluate which of its edges and/or respective vertices connected to these edges satisfy a first condition in the initial regular expression. If the first condition is met by an edge and or its connected vertex, the initial regular expression may be modified, if necessary, to reflect that the first condition has been met. The modified expression is then communicated to the connected vertex. The identity of the edge and/or the connected vertex may be recorded. A subsequent vertex may then proceed in a similar manner as the first vertex. | 12-31-2015 |
20160004787 | RELATIONAL GRAPH DATABASE SYSTEM - There is provided a novel method that generates relational graph data. A relational graph database system | 01-07-2016 |
20160012152 | EXECUTABLE GRAPH FRAMEWORK FOR THE MANAGEMENT OF COMPLEX SYSTEMS | 01-14-2016 |
20160012154 | INFORMATION PROCESSING SYSTEM THAT ORGANIZES AND CLEARLY PRESENTS MASS DATA TO USER, INFORMATION PROCESSING METHODS, AND RECORDING MEDIUM | 01-14-2016 |
20160019313 | STRIPING OF DIRECTED GRAPHS - Embodiments are disclosed for striping a directed graph, e.g., a social graph, so as to efficiently perform an operation to each node in the directed graph. At least some of the embodiments can select first and second sets of nodes from the directed graph to form first and second stripes. The first and second sets of nodes are selected, for example, based on available computing resources. First and second intermediate results can be generated by performing the operation to each node of the first and the second stripes, respectively. The operation iteratively performs a superstep. The first and the second intermediate results are combined to form a collective result as an output of the superstep. | 01-21-2016 |
20160019314 | INTEROPERABLE HIERARCHICAL MODEL FOR CONDUCTING MULTIUSER CAX OPERATIONS - A computer-implemented method for an interoperable hierarchical model for conducting multiuser CAx OPERATIONS may include (1) storing a model of an engineering object in a plurality of data nodes that are interconnected with a plurality of dependency references that specify one or more parent nodes for each non-root node of the plurality of data nodes, the plurality of data nodes and the plurality of dependency references corresponding to a directed acyclic graph, (2) indicating an operational order for each data node that has a common parent, and (3) executing in the indicated operational order a CAx-related function for each data node. Various other methods and systems are also disclosed. | 01-21-2016 |
20160048607 | IN-MEMORY GRAPH PATTERN MATCHING - Techniques for identifying, in a target graph, subgraphs that match a query graph are provided. Processing a query graph comprises multiple stages, one for each query node in the query graph. In the first stage, a query node is selected, different portions of the target graph are assigned to different threads, each thread identifies nodes that match the selected query node and stores the identities of those nodes in storage that is local to the thread. The results of each thread are then stored in a “global” data structure. In the second stage, a second query node is selected and different portions of the global data structure are assigned to different threads. Each thread identifies nodes that match the second query node and that are connected to a previously-matched node. The second stage repeats until all nodes in the query graph are processed. | 02-18-2016 |
20160055260 | VISUALIZATION AND DIAGNOSTIC ANALYSIS OF INTERESTED ELEMENTS OF A COMPLEX SYSTEM - An apparatus is provided for implementation of a system for visualization and diagnostic analysis of a complex system such as an aircraft composed of a plurality of elements. The apparatus may receive and process data for a physical instance of the complex system to identify a maintenance message for the complex system. A diagnostic procedure defined for and associated with the maintenance message, may involve or implicate one or more interested elements of the plurality of elements. The apparatus may generate a visual presentation of at least a portion of the complex system. The visual presentation may be digital media and depict the interested element(s) and one or more other elements of the plurality of elements. And the apparatus may apply a visual effect to the interested element(s) depicted by the visual presentation to distinguish the interested element(s) from the other element(s) depicted by the visual presentation. | 02-25-2016 |
20160055261 | USER-CONTROLLED GRAPH ANALYSIS SYSTEM - A graph analysis system provides a variety of graph analysis tools for analyzing graphs, such as an overall characteristics report, an entity types graph, an ego entity type graph, various histograms, and graph comparison reports. The graph analysis tools also include tools for calculating a similarity score for graphs based on characteristics and weights selected by a user. | 02-25-2016 |
20160070817 | SUPERVISED CHANGE DETECTION IN GRAPH STREAMS - A method includes obtaining a graph stream, obtaining historical data of one or more nodes associated with the graph stream, extracting one or more features from the graph stream for one or more nodes, and creating one or more alarm levels for the one or more nodes based on the one or more extracted features and the historical data. | 03-10-2016 |
20160070818 | ANCHORED PATTERNS - A method and apparatus relate to recognizing anchored patterns from an input stream. Patterns from a plurality of given patterns are marked as anchored patterns. An anchored state tree for the anchored patterns of the plurality of given patterns is built, including nodes representing a state of the anchored state tree. For each node of the anchored state tree, a failure value equivalent to a node representing a state in an unanchored state tree representing unanchored patterns of the plurality of given patterns is determined. | 03-10-2016 |
20160078148 | ESTIMATING SIMILARITY OF NODES USING ALL-DISTANCES SKETCHES - One or more all-distances sketches are generated for nodes in a graph. An all-distances sketch for a node includes a subset of the nodes of the graph, and a shortest distance between the node and each of the nodes in the subset of nodes. The generated all-distances sketches are used to estimate the closeness similarity of nodes. The estimated closeness similarity can be used for targeted advertising or for content item recommendation, for example. | 03-17-2016 |
20160085881 | Distributed Cache for Graph Data - In one embodiment, a system comprises a database operative to maintain a social graph, a leader cache layer comprising one or more leader cache clusters, and a follower cache layer comprising one or more follower cache clusters, wherein the leader cache layer is operative to, communicate social graph information between the follower cache cluster and the database, wherein each follower cache cluster maintains at least a portion of the social graph, receive a request from one of the follower cache clusters to store social graph information in the database, update the database storing the social graph responsive to the request, and update one or more of the follower cache clusters storing the portion of the social graph associated with the request. | 03-24-2016 |
20160092554 | METHOD AND SYSTEM FOR VISUALIZING RELATIONAL DATA AS RDF GRAPHS WITH INTERACTIVE RESPONSE TIME - Systems and methods for visualizing relational data as RDF graphs in order to explore connections between data in the relational schema. The relational data is first converted into an initial RDF graph. Referential constraints between tables in the relational data, including unasserted referential constraints and pseudo-referential constraints, are automatically detected and used to augment the RDF graph. In addition, datatype properties in the RDF graph may be folded into annotation objects for better visualization. The resulting graph may be an edge-node graph, with edges corresponding to referential constraints between nodes corresponding to relational table rows. | 03-31-2016 |
20160092597 | METHOD, CONTROLLER, PROGRAM AND DATA STORAGE SYSTEM FOR PERFORMING RECONCILIATION PROCESSING - A method for reconciling a target data node with a data graph encoding a plurality of interconnected data nodes. The method includes filtering an initial candidate set of data nodes from among the plurality of interconnected data nodes by performing a partial comparison process of a member of the initial candidate set with the target data node. The partial comparison process comprises comparing using hash function and removing: a member from the initial candidate set; and any other members from the initial candidate set having a semantic similarity with the member above threshold. Repeating the performing and removing until each remaining members of the initial candidate set has had the partial comparison process completed. The method includes performing full comparison processing between the target data node and each remaining member of the initial candidate set following the filtering, the full comparison processing using more hash functions. | 03-31-2016 |
20160103933 | VISUALIZATION OF RELATIONSHIPS AND STRENGTHS BETWEEN DATA NODES - One or more processors receive a dataset that includes a plurality of nodes. One or more processors identify relationships between a plurality of interacting nodes within the dataset. One or more processors determine relationship strength values between a plurality of interacting node pairs within the dataset. One or more processors generate a graphical representation that represents the relationship strength values between the plurality of interacting nodes within the dataset. Interacting node pairs are connected by edges and the edges have a length that correlates with the relationship strength value between the interacting node pairs. | 04-14-2016 |
20160110475 | Method and System of Determining Transitive Closure - A method for determining paths from a first vertex and a second vertex in an acyclic directed graph comprises determining a plurality of paths from one or more root vertices in the graph to one or more leaf vertices in the graph, storing each of the plurality of paths as a respective array in a computer database, each respective array comprising a respective root, a respective leaf, and up to a plurality of intermediate vertices, and determining whether the first vertex and the second vertex are both represented in one or more of the arrays. | 04-21-2016 |
20160117414 | In-Memory Database Search Optimization Using Graph Community Structure - Database searching is optimized utilizing a graph community structure. A graph is created from transaction data based upon adjacent value occurrences. This may be done by scanning transaction data from top to bottom, and creating an edge between a current index value and a previous index value. Next, algorithms identify communities in the graph to create a graph community structure. These communities comprise blocks of patterns of similar value-ids distributed in the transaction data. Scanning and transition indices may be created with an eye toward reducing memory usage and enhancing performance. Query searching is then executed in an efficient manner on a per-community basis. For example, exact queries, range queries, and/or “AND” queries may be executed more efficiently upon communities of records, skipping those not belonging to the same community. Embodiments are suited to search an in-memory database having large volumes of column-oriented data stored in RAM. | 04-28-2016 |
20160117415 | METHOD AND SYSTEM TO DISCOVER DEPENDENCIES IN DATASETS - A method of processing data stored in a database which comprises a plurality of rows and columns, the method comprising identifying a plurality of sets of column combinations, each set of column combinations comprising an identifier of at least one column allocating each set of column combinations to one of a plurality of nodes mapping the nodes to a lattice structure in which the nodes are connected in a superset or subset relationship according to the set of column combinations of each node selecting a current node processing the data in the set of columns of the current node to detect if the column combination is unique or non-unique traversing the lattice to a next node which is connected to the current node processing the data in the set of columns of the next node to detect if the column combination of the next node is unique or non-unique; and storing a record of whether each processed set of column combinations is unique or non-unique. | 04-28-2016 |
20160124998 | DEBUGGING A GRAPH - In certain aspects, a method includes: receiving a first graph that includes components and flows, the components representing operations performed on data records, the flows representing flows of data records between components; receiving a specification that is separate from the first graph, the specification defining one or more insertions, each of the insertions associated with a flow of the first graph; generating one or more components that each corresponds to one of the insertions; and generating a second graph that includes components and flows that correspond to at least some of the components and flows of the first graph and the one or more generated components. | 05-05-2016 |
20160125093 | PARTIAL GRAPH INCREMENTAL UPDATE IN A SOCIAL NETWORK - A social graph is divided into a series of partial graphs having limited hops and reference counts. For each of a plurality of nodes in the social graph, a partial graph for the node is created having a first degree list of nodes reachable in one hop and a second degree list of nodes reachable in two hops. Reference counts of how many paths exist between the node and each node reachable in two hops are also added to the second degree list. A global inverted index is maintained containing a list of all nodes in the social graph and for each node in the social graph a list of nodes that directly connect to the node. The partial graphs created for each of the plurality of nodes are distributed across a plurality of data servers. An index of which partial graphs are stored on which data servers is maintained. | 05-05-2016 |
20160132613 | SYSTEM, METHOD AND ARCHITECTURE FOR A DOCUMENT AS A NODE ON A SOCIAL GRAPH - A content management system may instantiate, from the same super class defined in a database schema, principal objects representing users and groups and content objects representing documents and folders. The principal objects and the content objects share the same social interaction functions. When a content object is modified, the system can create a message in which the content object identifies itself as a first person, update a message table such that any follower of the content object is notified of the message, and update a profile or feed associated with the content object. At least because content objects can “socialize” like principal objects, the system can generate a social graph containing content objects as nodes, map relationships among principal objects and content objects, and make recommendations to perhaps change/enhance such relationships. | 05-12-2016 |
20160171121 | Method, Controller, Program, and Data Storage System for Performing Reconciliation Processing | 06-16-2016 |
20160179982 | CANONICAL DATA MODEL FOR ITERATIVE EFFORT REDUCTION IN BUSINESS-TO-BUSINESS SCHEMA INTEGRATION | 06-23-2016 |
20160179983 | COLOCATION AND ANTICOLOCATION IN COLOCATION DATA CENTERS VIA ELASTIC NETS | 06-23-2016 |
20160203234 | SYSTEMS AND METHODS FOR ONTOLOGICAL SEARCHING IN AN IOT ENVIRONMENT | 07-14-2016 |
20160203235 | STRIPING OF DIRECTED GRAPHS AND NODES WITH IMPROVED FUNCTIONALITY | 07-14-2016 |
20160203236 | Method and Apparatus for Identifying the Optimal Schema to Store Graph Data in a Relational Store | 07-14-2016 |
20220138260 | METHOD, APPARATUS, AND SYSTEM FOR ESTIMATING CONTINUOUS POPULATION DENSITY CHANGE IN URBAN AREAS - An approach is disclosed for estimating population density change where dynamic signals are not available or are not dense enough to be representative. The approach involves, for example, determining map features of a first map space. The approach also involves identifying partitions of the first map space based on the identified partitions (i) having features that are substantially similar, and (ii) having respective change functions that are substantially similar. The approach further involves determining an estimated change function based on one or more of the respective change functions that are substantially similar and that are associated with the first map space. The approach further involves using the estimated change function for at least one partition of a second map space based on the at least one partition of the second map space and at least one map partition of the first map space having map features that are substantially similar. | 05-05-2022 |
20220138261 | HYBRID GRAPH AND RELATIONAL DATABASE ARCHITECTURE - Aspects of the disclosure relate to searching a dual database graph. The dual database graph is resident on a dual database graph platform. The platform includes two or more nodes interconnected by one or more edges. The graph database stores graph data corresponding to the graph(s) and a relational database for storing metadata corresponding to the graph(s). The method includes receiving as input a search criterion. The search criterion may include a plurality of data points corresponding to a relational database node profile or a relational database subgraph profile. The platform may search the relational database for a subset of graphs that each includes a relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion. The platform may then retrieve a relational database node or a relational database subgraph that matches the node profile or subgraph profile. | 05-05-2022 |