Abstract: Systems, methods and/or computer program products maximizing answer coherence of virtual agents responding to multi-part user queries, using relationships among extracted chunks corresponding to support document(s). Relationships are extracted by mining entities from text and images of support document(s) and mapping entities to an otology. Induced subgraphs for chunks, based on extracted entities are created and compared. Depending on amounts of overlap and/or relationships between subgraphs, relationships among chunks are identified. Chunks relationships can be complementary, contained within one another, instances of one another, or not related at all. For a given multi-part query, a query answer graph is created comprising answer nodes corresponding to potential answer candidates associated with each chunk.

Abstract: Techniques for concurrently supporting virtual non-uniform memory access (virtual NUMA) and CPU/memory hot-add in a virtual machine (VM) are provided. In one set of embodiments, a hypervisor of a host system can compute a node size for a virtual NUMA topology of the VM, where the node size indicates a maximum number of virtual central processing units (vCPUs) and a maximum amount of memory to be included in each virtual NUMA node. The hypervisor can further build and expose the virtual NUMA topology to the VM. Then, at a time of receiving a request to hot-add a new vCPU or memory region to the VM, the hypervisor can check whether all existing nodes in the virtual NUMA topology have reached the maximum number of vCPUs or maximum amount of memory, per the computed node size. If so, the hypervisor can create a new node with the new vCPU or memory region and add the new node to the virtual NUMA topology.

Abstract: Techniques are described for tree based in-place mechanism for pathfinding operations. In implementations, indications of a set of visual objects and pathfinding operations to be applied to the visual objects is received. Accordingly, a tree object (e.g., a tree structure) is generated and populated with nodes that represent individual visual objects and/or groups of visual objects. The tree object is traversed and pathfinding operations are applied to subsets of the visual objects based on their respective arrangement in the tree structure. For instance, the tree object is traversed according to a depth first search traversal where pathfinding operations are applied to subsets of visual object nodes to generate operation results. Further, subsets of the operation results become input to further pathfinding operations with additional visual objects until a final operation result is output. The final operation result is rendered and output, such as for display.

Abstract: Techniques are described herein for a graph-organized file system (GOFS) implemented by an operating system of a computing system. A GOFS represents a data graph with graph components comprising a plurality of nodes and one or more relationships between the nodes. Each node of the graph may be associated with content (of any kind) and/or relationships (of any kind) between the node and other nodes in the graph. Data for a GOFS is stored in a GOFS partition in persistent storage. In the GOFS partition, nodes are represented using “gnode” data structures (also referred to herein as “gnodes”), each of which comprises a content field for node content data and an edge field for edge data representing relationships between nodes. According to various embodiments, a GOFS partition includes dedicated space for each of: a superblock, graph metadata, a block bitmap, a gnode bitmap, a gnode table, and data blocks.

Abstract: A method, an electronic device, and a computer program product for obtaining a hierarchical data structure and processing a log entry is disclosed. The method for obtaining the hierarchical data structure includes: obtaining corresponding characteristic information included in each log entry of a set of log entries and determining multiple log entry patterns based on the corresponding characteristic information. The pattern characteristic information of each log entry pattern corresponds to the characteristic information of a subset of log entries in the set of log entries. The method also includes storing the set of log entries according to the hierarchical data structure so that each log entry is associated with at least one of multiple nodes of the hierarchical data structure. The multiple nodes respectively correspond to the multiple log entry patterns, and are hierarchically organized based on respective corresponding log entry patterns.

Abstract: Systems and methods for improving evaluation of graph queries through depth first traversals are described herein. In an embodiment, a multi-node system evaluates against graph data a graph query that specifies a particular pattern to match by determining, at a first node of the multi-node system, in a particular instance of evaluating the graph query, that one or more first vertices on the first node match a first portion of the graph query and that a second vertex that is to be evaluated next is stored on a second node separate from the first node. In response to determining that the next vertex to be evaluated is stored on the second node separate from the first node, the first node generates a message to the second node comprising one or more results of the first portion of the graph query based on the one or more first vertices, an identifier of the next vertex, and a current stage of evaluating the graph query.

Abstract: Methods and systems are presented for detecting groups within a graph using computer-based multi-threading techniques. These techniques provide technical improvements in computing power and efficiency for analysis of large graphs. A group detection system accesses a graph. Threads are instantiated to perform task related to a group detection process based on the nodes in the graph, where a thread is instantiated for a corresponding node. Each thread determines a neighbor count representing a number of neighbor nodes having one degree of separation from the corresponding node. Each thread also generates a list comprising an identity of the corresponding node and identities of the neighbor nodes. The thread transmits the list only to threads corresponding to a first subset of the neighbor nodes having more neighbors than the corresponding node, but not to threads corresponding to a second subset of the neighbor nodes having less neighbors than the corresponding nodes.

Abstract: A computer-implemented method comprises storing a connected entity graph in which a node corresponds to an entity type of an electronic note, a person, or an event, and an edge connects two nodes; receiving, via a graphical user interface (GUI), a specific entity type and a selection of a specific node; causing displaying in the GUI a second degree view, including the specific node in the center, first nodes connected to the specific node with zero or one intermediary node in the connected entity graph in a first concentric layout, and second nodes connected to the specific node with two intermediary nodes in the connected entity graph in a second concentric layout, the first nodes and second nodes corresponding to a common entity type, the specific node corresponding to a different entity type, and the nodes corresponding to an electronic note and the specific entity type.

Abstract: The present disclosure provides a new framework and associated techniques, referred to herein as “ego-splitting,” that enable the detection of clusters in graphs that are descriptive of networks, including highly complex networks. Ego-splitting leverages local structures within a graph known as ego-nets to de-couple overlapping clusters. For example, an ego-net can be the subgraph induced by the neighborhood of each node. Ego-splitting is a highly scalable and flexible framework, with provable theoretical guarantees. Ego-splitting reduces the complex overlapping clustering problem to a simpler and more amenable non-overlapping (also known as partitioning) problem. Ego-splitting enables the scaling of community detection to graphs with tens of billions of edges and outperforms previous solutions.

Abstract: In one implementation, a method includes receiving data characterizing a hierarchical dataset associated with hierarchical industrial assets. The hierarchical dataset can include a plurality of node data that can include a plurality of asset data and a plurality of edge data. An edge datum of the plurality of edge data is indicative of a relation between a pair of node data of the plurality of node data. Each node datum of the plurality of node data represents an asset in the hierarchical industrial asset and each edge datum of the plurality of edge data represents an edge in the hierarchical industrial asset. The method further includes receiving data characterizing a partition identifier associated with the hierarchical dataset can be received. The method also includes assigning, based on the partition identifier, a partition of a database to the hierarchical dataset. The method further includes storing the hierarchical dataset in the assigned partition.

Abstract: Multidimensional data analysis applications, including OLAP applications, simultaneously aggregate across many sets of dimensions. However, computing multidimensional aggregates is a performance bottleneck for OLAP data analysis applications. In order to improve the speed of interactive analysis, OLAP databases often precompute aggregates at various levels of detail and on various combinations of data attributes. However, the cost and speed of precomputation influences how frequently the aggregates can be brought up-to-date. Systems and methods disclosed herein provide graph based multidimensional analysis processing without pre-aggregating or precomputing the data along dimensional hierarchies, and by providing the results to the end user on-demand. Since preaggregation or precomputation of data along dimensional hierarchies is not necessary, implementations allow the end user to perform data analysis as soon as the data is available.

Abstract: A method for auditing a graph-based API includes obtaining a structure describing object types of the API and fields of the object types. A schema graph of the structure is generated including nodes representing object types. The nodes are connected by directed edges representing field resolution between object types. A line graph is generated and includes a node in place of each edge of the schema graph and edges in place of nodes of the schema graph. Frontiers of the line graph are determined, a frontier being subgraph of the line graph such that (1) the subgraph is rooted at a line graph node that represents a field of the API that accepts at least one field argument and (2) the subgraph is a maximal subgraph of the line graph that is disjoint from other line graph nodes that represent fields that accept at least one field argument.

Abstract: Various embodiments provide methods, systems, apparatus, computer program products, and/or the like for managing, ingesting, monitoring, updating, and/or extracting/retrieving information/data associated with an electronic record (ER) stored in an ER data store and/or accessing information/data from the ER data store, wherein the ERs are generated, updated/modified, and/or accessed via a graph-based domain ontology.

Abstract: A data sorting method, apparatus and device, a storage medium, and a program product. The method includes: obtaining a data sorting and updating request, where the data sorting and updating request includes data to be updated and an update type; determining a current cursor node, according to the data sorting and updating request, from a circular doubly linked list corresponding to a binary heap storing original data and according to pointing of the current cursor node pointer; determining a node to be updated corresponding to the data to be updated in the binary heap according to the update type and the current cursor node; and performing updating and sorting operations on the original data according to the node to be updated and the data to be updated.

Abstract: Disclosed methods and systems allow a central server to monitor electronic units of work accessible to a group of computers and generate a nodal data structure representing the units of work. The server then uses various protocols, such as hashing algorithms and/or executing artificial intelligence and machine learning models to identify similar and/or related units of work. The server then merges/links the nodes corresponding to the similar/related units of work. The server also monitors all user activities. When a user or a software system/service accesses electronic content on his, her, or its electronic device, the server identifies a node corresponding to the accessed electronic content and associated unit(s) of work and presents searchable data and actions related to the identified node and any related/linked nodes.

Abstract: A method of interactive visual analysis is performed at a computer. The computer generates a data visualization by executing a data visualization data flow graph comprising a directed graph having a plurality of nodes. Each of the nodes specifies either a data retrieval operation or a data transformation operation and the data visualization comprises visual marks having a first set of characteristics, including a first mark type and one or more first visual mark encodings. A user specifies a second mark type and/or one or more second visual mark encodings. In response, the computer updates a portion, less than all, of the data flow graph according to the second mark type and/or the one or more second visual mark encodings, and generates an updated data visualization by executing updated nodes of the data flow graph without executing nodes not updated according to the user input.

Abstract: A method, system and computer-usable medium are disclosed for using travel-related cognitive graph vectors.

Abstract: Example task assignment methods disclosed herein for video analytics processing in a cloud computing environment include determining a graph, such as a directed acyclic graph, including nodes and edges to represent a plurality of video sources, a cloud computing platform, and a plurality of intermediate network devices in the cloud computing environment. Disclosed example task assignment methods also include specifying task orderings for respective sequences of video analytics processing tasks to be executed in the cloud computing environment on respective video source data generated by respective ones of the video sources.

Abstract: There is provided a method and a system for ranking subgraphs as potential explanations for a labelled edge type class. A first graph representing labelled digital items is obtained, where each labelled digital item is represented as an entity node connected via a labelled edge type to a property value node. The first graph is combined with a second graph representing structured relations in the labelled digital items to obtain a combined graph. Unlabelled digital items are received and matched to respective subgraphs in the combined graph. A machine learning model is used to embed the combined graph to generate graph vectors, and an expressivity score between matched subgraphs and respective labelled edge types based on the generated graph vectors. The matched subgraphs are ranked based on the expressivity score to obtain a ranked set of subgraphs as potential explanations for a respective labelled edge type class.

Abstract: System and techniques for dynamically building a file graph are described herein. Meta data is received for a first and a second file. An intersection of the first metadata set and the second metadata set is computed. An edge in a file graph is created based on the intersection. Then, after receiving a query about the first file, the second file is provided as a result to the query based on the edge in the file graph.

Abstract: The invention relates to the verification of properties of an interactive component having a recursive tree structure of subcomponents. The verification comprises creating an oriented graph from the tree, said oriented graph comprising arcs for the child relationships of the tree, and arcs for couplings creating upon couplings between the components. The verification comprises creating a second graph representative of the property, and verifying if the second graph is exhibited within the first oriented graph.

Abstract: Example embodiments of the present invention provide a method, a system, and a computer program product for managing tasks in a system. The method comprises running a first task on a system, wherein the first task has a first priority of execution time and the execution of which first task locks a resource on the system, and running a second task on the system, wherein the second task has a second priority of execution time earlier than the first priority of execution time of the first task and the execution of which second task requires the resource on the system locked by the first task. The system then may promote the first task having the later first priority of execution time to a new priority of execution time at least as early as the second priority of execution time of the second task and resume execution of the first task having the later first priority of execution time.

Abstract: The present disclosure involves systems, software, and computer implemented methods for a grid-based rendering of nodes and relationships between nodes. One example method includes identifying model information that identifies nodes and relationships between nodes. The identified nodes are rendered, in a grid layout in a graphical model. Each cell of the grid includes at most one node, and the cells are separated by lane areas in which connections can be rendered. Connections between the nodes are rendered in the lane areas. The connections correspond to the relationships between the related nodes. One or more portions of the connections are overlapped when two or more connections are drawn in a same lane area. The connections, the nodes, the lane areas are selectable. A user selection of a selectable item is received. In response to the user selection, the connections and nodes that are associated with the selectable item are highlighted.

Abstract: This document describes, among other things, systems and methods for managing distributed parallel builds. A computer-implemented method to manage parallel builds, comprises identifying one or more software components in a software project, wherein each software component includes an executable binary file; determining a build configuration for each software component, wherein the build configuration includes a mapping from each software component to one or more build servers; and building each software component using the mapped one or more build servers in the corresponding build configuration, wherein the building includes compiling one or more source files associated with each software component to one or more object files, by distributing the one or more source files to one or more compilation machines.

Abstract: A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.

Abstract: A system and method for generating an interactive sitemap of a website includes steps of: receiving an identifier of a user visiting the website; storing identifiers of the website pages visited by the user; associating the website page identifiers with the user identifier; capturing a snapshot of each website page visited by the user; determining website pages recommended for the user, but not yet visited by the user; capturing a snapshot of at least one recommended website page; and generating the interactive sitemap that includes a sitemap tree structure of the website with selectable nodes representing the website pages visited by the user and the website pages recommended for the user. When the user rolls over one of the selectable nodes, presenting the snapshot within the in-page window.

Abstract: In the processing of a query while being translated from the SPARQL language to the SQL language, a manner of navigation through the one or more graphs is provided. The plurality of the nodes in the one or more graphs generated from the query is identified. The plurality of the nodes are assigned a priority and arranged in the priority queue based on the assigned priorities. The node with a highest assigned priority is selected each time for execution of the query from the selected node. The one or more graphs are navigated from the selected node to traverse to the one or more nodes connected with the selected node. An access plan element is generated corresponding to the selected nodes and the one or more traversed nodes.

Abstract: Techniques for establishing a files system that exposes a virtual file system for backup operations are presented. Changes to files of a file system are maintained separately or collected and presented as a VFS. The VFS is then used to perform backup operations. Moreover, the files identified in the VFS can be customized based on search parameters, criterion, and/or criteria supplied by a user or supplied as parameters to backup and VFS mount operations.

Abstract: A method and system configured for receiving data associated with a virtual connection between a client and server communicating using SCSI over a fiber channel network by a server fiber channel adapter, identifying a data stream for the virtual connection, and writing the data to a tail of a singly linked list of the data stream without a lock by a producer process thread while a consumer process thread has access to the linked list of the data stream.

Abstract: To address problems related to use and formation of tables of contents, the present inventors, devised among other things, an exemplary table-of-contents (TOC) data structure and related systems and methods. One exemplary method entails associating a node from one TOC with a node of another TOC and then assigning a unique identifier to the associated pair of nodes. The unique identifier can then be used to logically define another TOC that includes portions of the two original Tics. Another exemplary method entails tagging or associating nodes of a TOC with one or more view labels. (Identifiers for node relationships rather than the nodes themselves are tagged with the labels in some embodiments.

Abstract: A plurality of stored data sequences that match one or more search data sequences are determined. Each of the stored data sequences of the plurality of stored data sequences comprise a plurality of data elements and the stored data sequences are stored in a content addressable memory array. A longest stored data sequence of the plurality of stored data sequences is determined using a plurality of tracing circuits. An address associated with the longest stored data sequence of the plurality of stored data sequences is determined. A count of data elements of the longest stored data sequence of the plurality of stored data sequences is determined.

Abstract: A system construction supporting apparatus searches through, when receiving an input for arranging a component on the system configuration diagram anew, association information in which combinations among components connectable to one another are described and extracts a component connectable to a component selected by the input, connects a display object of the selected component and a display object of the extracted component each other and arranges the display objects, and independently moves, when receiving an input for moving one of a plurality of display objects connected to one another and arranged on the system configuration diagram (Yes at step S53), the display object designated by the input while deforming a connection line connecting the display object designated by the input and another display object connected to the display object while maintaining a connection relation between the display objects by the connection line (steps S60 to S62).

Abstract: Analytics applications are generated using application modules. An application module stores metadata for use in an analytics application. The application module is associated with one or more data fields that correspond to data used in the analytics reports of an application module. An application module may be a composite application module that includes other application modules. An analytics application is generated from a specification including a set of fields. The set of data fields of the specification are matched against the data fields of the application modules. An application module matches the specification of the analytics application if the specification includes all the data fields of the application module. All matching application modules are selected and sent for deployment of the analytics application. The analytics application generated is configured to present information based on analytics reports.

Abstract: Techniques are described herein that are capable of deep cloning (a.k.a. deep copying) objects using a binary format. A deep clone of a designated object includes references to other objects (and potentially copies of the other objects) included in the designated object. A binary representation of each object in an object graph is generated to provide a binary clone of the object graph. Objects created by a dynamic language engine are called dynamic language objects. Objects created by a host (e.g., that hosts the dynamic language engine) are called host objects. Each host object is associated with an intermediate representation thereof via a property bag that describes properties of that host object. Each intermediate representation is understandable by the dynamic language engine. A binary representation of each dynamic language object and each host object may be generated in accordance with the binary format to provide the binary clone.

Abstract: Computer-implemented method, system, and computer program product for processing data in an out-of-order manner in a streams computing environment. A windowing condition is defined such that incoming data tuples are processed within a specified time or count of each other. Additionally, the windowing condition may be based on a specified attribute of the data tuples. If the tuples are not processed within the constraints specified by the windowing condition, the unprocessed tuples may be discarded, i.e., not processed, to optimize operator performance.

Abstract: A graph database storage system contains a graph database that has multiple graph nodes. A first pointer points from a particular graph node to a particular synthetic context event node in a synthetic context event database. A second pointer points from the particular synthetic context event node in the synthetic context event database to a particular data store in a data structure, such that the first pointer and the second pointer associate the particular data store with the particular entity represented in the graph database via the particular synthetic context event node.

Abstract: A context-based graph-relational intersect derived (CB-GRID) links a real entity graph node to a synthetic entity graph node. The real entity graph node comprises a pointer to a primary key in a first tuple that non-contextually describes the real entity. A primary relational database comprises the first tuple that non-contextually describes the real entity. A context relational database comprises a second tuple that contains a foreign key that matches the primary key in the primary relational database. The second tuple dynamically describes a context of data in the first tuple. A contextual entity relational database comprises a third tuple that contains data from the first tuple and the second tuple. The synthetic entity graph node describes a synthetic entity that is described by data in the third tuple, such that the contextual entity relational database links the real entity graph node to the synthetic entity graph node.

Abstract: A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.

Abstract: A method and apparatus for dynamic filtering of an object graph in a content repository. The method comprises accessing a plurality of objects in an object graph of a content repository; forming a request using at least one filtering expression, wherein the filtering expression is used to perform an operation on a selected subset of objects in the object graph; and executing the request on the selected subset of objects, using the at least one filtering expression.

Abstract: Community ratings are determined for users of an electronic marketplace. In a typical configuration, the community rating of an individual reflect the individual's reputation in the electronic community (e.g. feedback rating) as well as the reputations of the users the individual sponsors and the reputations of each user they sponsor, and so on. Various methodologies are provided for determining a community rating, such as aggregating feedback ratings, or weighting or thresholding these feedback ratings.

Abstract: Embodiments of the invention include methods for identifying one or more clusters in a streaming graph, the method includes receiving a stream of edges and sampling the stream of edges to create a structural reservoir and support reservoir. The method also includes creating a sampled graph from the structural reservoir and identifying the one or more clusters in the sampled graph by grouping one or more connected vertices in the sampled graph.

Abstract: A system for clustering vertices in a streaming graph includes a structural sampler configured to receive a stream of edges. The structural sampler includes a reservoir manager configured to receive the stream of edges and create a structural reservoir and a support reservoir and a graph manager configured to receive the structural reservoir from the reservoir manager and to create a sampled graph from the structural reservoir, wherein the sampled graph includes one or more clusters that each include one or more connected vertices.

Abstract: Representation of an array in dynamically-typed program code at runtime is provided. Program code is accessed at runtime. An instruction for adding, updating or deleting one or more elements for an array is detected within the code. The array is associated with a first kind of element comprising a first representation and packing format. A second kind of element is determined based on at least one of the instruction or the one or more elements, the second kind of element comprising at least one of a second representation or packing format. A determination is made that the first and second kind of elements are not consistent, based on an inconsistency between the first and second representation formats or packing formats. The array is converted so that the first and second kind of elements are consistent. One or more array elements are added, updated or deleted based on the instruction.

Abstract: 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.

Abstract: One embodiment of the disclosure can represent within a K-partite graph, weighting factors between a set of identifier elements and a set of data elements. The K-partite graph can also represent weighting factors between the set of identifier elements and a set of metadata elements. In the K-partite graph, the set of identifier elements, the set of data elements, and the set of metadata elements are independent and disjoint sets such that no two vertices within a same set are adjacent. A score vector can be calculated that ranks each data element in a set of data elements. The score vector can be calculated from the weighting factors. At least one data element from the set of data elements can be selected using the score vector and a predetermined selection criterion.

Abstract: One embodiment of the disclosure can represent within a K-partite graph, weighting factors between a set of identifier elements and a set of data elements. The K-partite graph can also represent weighting factors between the set of identifier elements and a set of metadata elements. In the K-partite graph, the set of identifier elements, the set of data elements, and the set of metadata elements are independent and disjoint sets such that no two vertices within a same set are adjacent. A score vector can be calculated that ranks each data element in a set of data elements. The score vector can be calculated from the weighting factors. At least one data element from the set of data elements can be selected using the score vector and a predetermined selection criterion.

Abstract: A system, method, and computer program product are provided for performing graph aggregation. In use, a graph with a plurality of vertices and a plurality of edges is identified. Additionally, graph matching is performed on the vertices and edges of the graph by computing a graph matching, wherein the performance of the graph matching is optimized.

Abstract: A directed graph comprises a plurality of nodes including a root node and a non-root node. Each of the plurality of nodes has a plurality of directed edges. The directed graph is traversed, with the plurality of nodes being visited according to an order of the directed edges of each of the plurality of nodes. The directed edge that leads to the non-root node is discarded when the non-root node is visited for the first time during the traversal of the directed graph.

Abstract: Embodiments of the claimed subject matter provide methods that support extension of web service application programming interfaces using query languages. In one embodiment, a method is provided that includes modifying an interface to a social graph. The social graph includes nodes connected by edges that represent relationships between the nodes, which form a plurality of trees associated with users to the social graph. Modifying the interface includes adding a node to at least one user's tree and attaching one or more queries to the node. The attached queries operate on a sub-tree of the added node. The interface is modified in response to the user(s) invoking a service configured to perform queries on the sub-tree.

Abstract: Embodiments of the claimed subject matter provide a method of controlling access to resources in a social graph. One embodiment of the method includes receiving information for configuring a query in response to a service being invoked. The service is configured to use the query to request access to resources associated with a node in a portion of a social graph associated with a first user. The method also includes associating the query with the node. The query operates on the resources associated with the node and returns information indicating whether a request to access the resources is granted or denied depending on a current state of the social graph.