Abstract: Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying two entities represented as nodes in a social graph, the social graph is analyzed to identify connection paths connecting the nodes representing the two entities. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path or paths having the highest path scores, as derived by aggregating edge scores assigned to the edges, may be presented.

Abstract: A PDM system, method, and computer program product for traversing a large data structure including corresponding runtime objects. A method includes receiving traversal parameters including a plurality of unique object identifiers (UIDs) corresponding to objects in a data structure. The method includes receiving input objects, including input runtime objects, and closure rule clauses. The method includes configuring runtime objects, from the objects in the data structure, according to the traversal parameters, and storing the runtime objects in a temporary table. The method includes traversing the data structure and temporary table using the closure rules to produce traversed objects, and serializing and storing the traversed objects.

Abstract: A PDM system, method, and computer program product for data transfer. A method includes determining a plurality of bill of material (BOM) components for a BOMLine by the PDM data processing system. The method includes determining a last export date for the BOMLine and determining a last saved date for at least one of the plurality of BOM components. The method includes creating an updated BOMLine corresponding to the components, without traversing a BOM structure, when the last saved date is more recent than the last export date, and publishing the updated BOMLine.

Abstract: A method is provided in one example and includes crawling a storage location of a network environment to identify objects, fetching the identified objects, creating indexes corresponding to the identified objects, and classifying one or more objects of the identified objects based on a first category. The method further includes providing first sets of metadata elements and corresponding first category information representing the classified one or more objects of the identified objects, searching the indexes for a selected group of the classified one or more objects of the identified objects, and classifying one or more objects of the selected group based on a second category. In more specific embodiments, the method includes applying a remediation policy to the classified one or more objects of the selected group. In other more specific embodiments, the method includes registering the classified one or more objects of the selected group.

Abstract: A method is provided in one example and includes receiving first sets of metadata elements representing an inventory of objects in a data storage location of a network environment and presenting an inventory view of the objects to a user. The inventory view includes a first summary of the inventory objects. The method further includes receiving a request from the user to manipulate the inventory view based on a first selected dimension group and presenting to the user a manipulated inventory view that includes a second summary of a first subset of the inventory objects. In more specific embodiments, the method includes receiving a request from the user to perform a protection task on objects of the first subset and initiating the protection task. The protection task includes one of applying a remediation policy to the objects of the first subset and registering the objects of the first subset.

Abstract: A method is provided in one example and includes receiving first sets of metadata elements representing objects of an inventory and generating a first summary of a first subset of the objects. The method further includes receiving second sets of metadata elements and corresponding category information representing objects of the first subset that are classified based on a first category and generating a second summary of a second subset of the classified objects. In yet further embodiments, the method includes initiating a protection task for objects of the second subset of the classified objects. In more specific embodiments, the protection task includes applying a remediation policy to the objects of the second subset or registering the objects of the second subset. In yet other embodiments, the second summary includes at least one of a total count and a total size of the objects in the second subset.

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

Abstract: A method, computer program product and system for managing tenant-specific data sets in a multi-tenant system, by receiving a request to convert a data set in a physical data store from a first type of multi-tenant deployment to a second type of multi-tenant deployment, retrieving tenant identification metadata identifying a tenant making the request, modifying the data set in the physical data store based on the second type of multi-tenant deployment, and modifying metadata associated with an abstraction layer to allow the modified data set to be accessed.

Abstract: An embodiment provides a system and method for implementing a scalable test environment. The method includes modeling, within a file system environment creator executing on a computing device, a structure of a file system used by an application and intercepting a system call from the application to the file system at the file system environment creator. The method also includes generating a content of the file system dynamically within the file system environment creator based on the system call and the structure of the file system.

Abstract: A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.

Abstract: A schema for a mark-up language provides a meaningful name and a short name, both of which are valid, for each of a plurality of data fields in messages coded in a mark-up language such as extensible mark-up language (XML). Code conversion of legacy data to use the short names reduces data volume for transmission, storage and processing while allowing the message to be automatically displayed for inspection, diagnostics and data synchronization during a transformation project such as an upgrade of a data processing system for verification of system operation. The ability to display meaningful names only for such purposes allows text editor arrangements to be used for data synchronization while use of short names improves virtually all aspects of system performance.

Abstract: Certain example embodiments relate to techniques for automatically deriving web service permissions based on XML structure permissions. A call for a web service operation is received from a client at a web service runtime engine. XML data objects from a database of XML data objects located on an XML server implicated by the called web service operation are identified. The XML data objects have corresponding XML data structures. Access permissions for the user for the identified XML data objects are retrieved from the XML server, the access permissions for the web service having been generated automatically from access permissions based on the XML data structures for corresponding XML data objects. The called web service operation is either permitted or prohibited based on a determination, at the web service runtime engine and based on the retrieved access permissions. Thus, data access requests are handled in the “higher” web service layer.

Abstract: Path-decomposed trie data structures are described, for example, for representing sets of strings in a succinct manner whilst still enabling fast operations on the string sets such as string retrieval or looking up a string with a specified identifier. A path-decomposed trie is a trie (tree data structure for storing a set of strings) where each node in the path decomposed trie represents a path in the trie. In various embodiments a path-decomposed trie data structure is represented succinctly by interleaving node labels and node degrees in an array and optionally by compressing the node labels using a static dictionary. Node labels may be string characters and a node degree may be a number of children of a node. In some embodiments a path-decomposed hollow trie data structure is used to provide a hash function for string sets.

Abstract: The present disclosure relates to computing techniques. Data arrays are processed using Bloom filters to determine aggregate count, maximum, and minimum. These methods can be used on different types of data, including data groups, partial groups, data cubes, hypercubes, and others.

Abstract: According to one embodiment of the present invention, a system determines key relationships between database tables and includes a computer system including at least one processor. The system determines a sampling range for one or more matching columns between first and second database tables. The matching columns satisfy one or more matching criteria and the sampling range is based on quantities of distinct values within the matching columns. Data is sampled from the first and second database tables in accordance with the sampling ranges to determine a sample set. Keys between the first and second database tables are determined based on matching between columns within the sample set. Embodiments of the present invention further include a method and computer program product for determining key relationships between database tables in substantially the same manner described above.

Abstract: Improved, re-arrangeable, and/or customizable data tree hierarchies, and methods of use thereof, are provided. In one embodiment, a method for customizing a data tree hierarchy includes providing, to a plurality of communication devices that are each associated with one or more respective users, access to a data tree hierarchy. The data tree hierarchy is adapted to include a plurality of data items, and each of the plurality of data items is positionable at one of a plurality of hierarchal levels. The method also includes receiving input from one or more of the communication devices to change a position of one or more of the plurality of data items in the data tree hierarchy, and changing the position of the one or more of the plurality of data items in the data tree hierarchy in response to receiving the input from the one or more of the communication devices.

Abstract: A method is provided for parsing a table. The method includes: receiving an input containing the table; finding candidate separators within the table; and determining which candidate separators are at least one of real and spurious by optimizing an objective function over the set of found candidate separators. Suitably, the function measures numerically whether a parse produced by the set of real separators is accurate. The function suitably includes one or more terms that account for multiple aspects of the table including at least two of: quality of candidate separators; coherence of cells within the parse; quality of cells within the parse; coherence of entire rows within the parse; quality of entire rows within the parse; coherence of entire columns within the parse; quality of entire columns within the parse; layout consistency along an axis of the table; and repeatability along the axis of the table.

Abstract: Task list linking may be provided. Upon receiving an input from a user, the input may be translated into at least one actionable item. The at least one actionable item may be linked to a data source and displayed to the user.

Abstract: Devices, systems and methods are disclosed which relate to a plurality of multimedia devices operating on a common time base having the ability to synchronize playback of a multimedia sample. A user initiates a synchronized playback by sending a request to one or more multimedia devices across a network. The user selects a multimedia sample and a start time. When the request is received by other multimedia devices on the network it can be accepted or denied. If the recipient accepts, the multimedia sample can be downloaded or cached before or streamed at the time of play. Many can enjoy listening to the same multimedia sample even using headphones. This enables a group to enjoy synchronized movement without requiring a sound system other than headphones.

Abstract: An information retrieval system having: a client adapted for accessing a plurality of file sets stored on one of a plurality of file servers; a plurality of file servers configured to operate with a federated file system namespace; and a memory for storing re-direction information accessible by the client for identifying a request issued by the client for a file set at a first location in the namespace where the file set is located at a second, different location on one of the file servers and wherein the client in examining the re-direction information in the memory, re-directs the request to the second location in accordance with the re-direction information.

Abstract: A computer-implemented process (200) for assessing the raw size of a compressed database involves sampling (201) a subset of the cells of the database. The raw sizes of the sampled cells in the subset are assessed (202). The raw size of the database is determined (203) based on the raw sizes of the sampled cells.

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

Abstract: According to one embodiment of the present invention, a system analyzes data in response to detecting occurrence of an event, and includes a computer system including at least one processor. The system maps fields between the data and a fingerprint definition identifying relevant fields of the data to produce a fingerprint for the data. The data is deleted after occurrence of the event. The produced fingerprint is stored in a data repository, and retrieved in response to detection of the event occurrence after the data has been deleted. The system analyzes the retrieved fingerprint to evaluate an impact of the event on corresponding deleted data. Embodiments of the present invention further include a method and computer program product for analyzing data in response to detecting occurrence of an event in substantially the same manner described above.

Abstract: In some embodiments, a mobile device includes an interface configured to scan information from a communication tag associated with an asset, a memory operable to store the information, and a processor communicatively coupled to the memory. The information comprises a header describing the information, business application data, and asset identification data uniquely identifying the asset. The processor is configured to extract the business application data from the information scanned from the communication tag and extract the asset identification data from the information scanned from the communication tag.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a hash vector r, a vector of locality-sensitive hash values, each hash value being an element of the hash vector r, each element having an index position; and generating a compact vector v corresponding to the hash vector r, wherein the compact vector v is a vector of compact elements each having an index position, wherein each compact element corresponds to the element of the hash vector r having the same index position, and wherein each compact element is a b-bit integer selected from the set of all b-bit integers {0, 1, . . . , 2b?1} based on the corresponding hash element.

Abstract: A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures.

Abstract: Methods, systems, and computer-readable storage media for user-guided multi-schema integration and include actions of receiving a plurality of schemas, each schema defining a data structure and including a plurality of intermediate elements and a plurality of leaf elements, receiving leaf correspondences that match leaf elements between schemas of the plurality of schemas, processing the plurality of schemas and the leaf correspondences using closed frequent itemset mining to define a first plurality of redundancy groups, each redundancy group including a proposed correspondence between intermediate elements of schemas, displaying the first plurality of redundancy groups to a user, receiving user input, the user input including one or more actions to one or more redundancy groups in the first plurality of redundancy groups, processing the plurality of schemas, the leaf correspondences and the one or more actions to define a second plurality of redundancy groups, and displaying the second plurality of redundan

Abstract: In an exemplary embodiment, a system includes a memory and a processor communicatively couple to the memory. The processor is operable to receive a first indication that a first database table is selected from a plurality of database tables, wherein each database table is comprised of rows and columns, and retrieve a first plurality of columns, wherein each column is associated with the first database table. The processor is further operable to facilitate the display of the first plurality of columns, receive a second indication that a first column is selected from the first plurality of columns, and receive a third indication that at least one cell in the first column is selected. The processor is further operable to receive an expected data set, store the expected data set in the at least one cell, and compare a sample data set to the expected data set.

Abstract: Techniques for capturing images of business cards, uploading the images to a designated computing device for processing and recognition are disclosed. A mechanism is provided to update extracted data from the images when there are any changes. Depending on implementation, there are a number of ways to capture images of business cards (e.g., via a phone camera, a PC camera, or a scanning device). A transmission means is provided to transport the images to the designated computing device for centralized management of integrated contact information for individual users. As a result, a user may access his/her updatable integrated contact information database anywhere anytime from a chosen device.

Abstract: Legacy computing system archive files may have unique data structures designed for long-term data retention purposes and not particularly suited for data mining, querying, and other data collection functions needed to prepare certain types of reports. A report specific template may be created to facilitate the extract of specific legacy system data necessary to complete report that is stored in legacy system archive files. Once the data objects containing information relevant to the report have been identified, a hierarchical list of tables and fields of each table associated with each identified data object may be obtained from an external data source for further selection. Copies of the selected table and/or field data may then be extracted, compared, and merged with other data, such as other field and table data, obtained from other sources.

Abstract: Provided are a computer program product, system, and method for processing input data in a storage system and in communication with a repository. Views are generated that comprise a tree of nodes selected from a subset of nodes in a hierarchical representation of a schema. The views are saved to the repository. At least one of the views are used to create a job comprising a sequence of data transformation steps to transform the input data described by input schemas to the output data described by output schemas.

Abstract: Provided is a method for processing input data in a storage system and in communication with a repository. Views are generated that comprise a tree of nodes selected from a subset of nodes in a hierarchical representation of a schema. The views are saved to the repository. At least one of the views are used to create a job comprising a sequence of data transformation steps to transform the input data described by input schemas to the output data described by output schemas.

Abstract: Provided are a computer program product, system, and method for processing schemas in a storage system. A presentation of a schema in a graphical user interface (GUI) is comprised of multiple type nodes in a tree structure. Each type node comprises a hierarchical arrangement of a plurality of nodes including group nodes including a plurality of nodes and content nodes providing values. First user input selects one of the type nodes in the schema for a view. Second user input selects one of the nodes in the selected type node in the schema for a view. Third user input selects a node in the schema to indicate a root node of the schema for the view. The view includes the root node and at least one sub node of the root node and is added as a child to the selected type node.

Abstract: Provided are techniques for updating web content. A data mining scan of one or more data sources is performed for one or more topics to identify one or more trending topics. One or more relationships of the one or more trending topics to content objects are identified. One or more recommendations on how to update the web content based on the one or more relationships are provided. Input is received on the one or more recommendations. In response to the received input, the web content is automatically updated based on making associations between the web content and the content objects.

Abstract: A computer-implemented process ad methodology that selects collateral instruments such as equipment leases, using mathematical models, based on selection criteria, risk-reward relationships, and maturity needs resulting in the creation of new financial instrument derivatives. These new derivatives allow for creation of secured private equity, public equity, mutual funds and venture capital funds where the investors' principal is safeguarded against loss regardless of the performance of the investments being made. A two-tier investment structure is created whereby the principal amounts from the fund are invested in specially identified high yield vehicles such as residual equipment leases with high yields over certain maturities. The high yield cash flow only is then invested in higher risk investments such as venture capital start-ups companies.

Abstract: An embodiment of the invention, directed to assessing quality of recorded service data, comprises the step of receiving a record containing service data at a service record evaluator. The method further comprises selecting at least one information field of a plurality of information fields contained in the received record, and determining a numerical quality score for each selected information field. Each of the quality scores is used to compute a cumulative quality score for the record, and it is determined whether the cumulative quality score is no less than a minimum quality threshold.

Abstract: A method and program for managing the association of works and their copyrights for producing a compilation of works, including the step of obtaining works to be compiled having copyright metadata associated with each work of the works to be compiled by searching for works to be compiled, retrieving copyright metadata of the works to be compiled, and associating copyright metadata to each work of the works to be compiled, and the step of re-associating copyright metadata of a work with a user's own digital file of the work.

Abstract: Methods, program products, and systems for rendering data using multi-tiered caches are described. A system can render a first section of data and store the rendered first section of data in a first tier cache. The system can determine that a data field, when rendered, straddles the rendering of the first section of data and a rendering of a second section of data. The system can generate a rendering of the data field and store the rendering of the data field in a second tier cache. When rendering the second section of data, the system can use the rendered data field stored in the second tier cache instead of regenerating the rendering of the data field.

Abstract: The capturing of rich database metadata includes: capturing partitioned column metadata of a database as mappings defined by a plurality of constraint statements; defining non-standard user-defined types of the database according to a schema; defining physical representations of columns of the database according to the schema; and storing the defined mappings, the defined user-defined types, and the defined physical representations of columns to a catalog of the database. Application enumerated data values in the database may also be defined according to the XML schema and stored to the catalog of the database. In this manner, the database management system may manage application constraints, user-defined types, and physical representations of data for applications referencing the same database using the metadata information stored in the catalog of the database.

Abstract: A system includes reception of a logical schema associated with a data store, generation of an input schema based on the logical schema, reception of an expression having a type of the input schema and representing the topology of a data set, the data set being an instance of the input schema, compilation of the expression to a data specification based on the input schema, and generation of a plan to execute on the data store based on the data specification.

Abstract: Embodiments of the present invention describe using a data structure to represent variable domains in solving a constraint problem. The data structure includes nodes that are configured to represent ranges of values in order to save memory space and processor power. Ranges of values and single values may be both added to and removed from the data structure such that the data structure does not include duplicate values. Operations may include detecting multiple nodes with adjacent or overlapping ranges that may be combined into a single node, and adding or removing all the values in the structure that are beyond a threshold value. In one embodiment the data structure may be a balanced binary tree. Constraint solvers may either add values to the data structure as the values are eliminated from the solution, or they may remove those values.

Abstract: Embodiments of the invention include systems, methods, and computer-program products that assist a user in managing data on a mobile device. In one embodiment of the invention, the computer-implemented method receives data associated with a mobile device and stores the data in a database. The computer-implemented method then periodically updates the data in the database until the user desires to load the data onto the mobile device or onto a new mobile device. At the user's request, the computer-implemented method loads the data onto the mobile device. In some embodiments, the computer-implemented method determines the operating system of the mobile device and assists the user in conveniently transferring data from one mobile device to another mobile device. In further embodiments, the computer-implemented method augments the data with publicly or privately available information.

Abstract: Embodiments for using a dynamic structure of tables in a schema of a multi-tenant database are provided. For a tenant schema including a set of tenant tables, a label is created for a tenant table in the set of tenant tables. The label is partitioned into a set of constituent primary labels. A subset of columns is selected from the set of n columns of the tenant table, the subset of columns corresponding to a primary label in the set of constituent primary labels. The subset of columns is mapped to a table in the dynamic structure of tables in the schema of the multi-tenant database, the table in the dynamic structure of tables having the primary label. In the multi-tenant database executing in a data processing system, the dynamic structure of tables is populated with data from the tenant schema according to the mapping.

Abstract: Contentual metadata of an extended cache is stored within the extended cache. The contentual metadata of the extended cache is approximated utilizing a counting Bloom filter. The counting Bloom filter is stored within a primary cache. Contentual metadata of the primary cache is stored within the primary cache. One of a data read or a data write is executed without accessing the contentual metadata of the extended cache stored within the extended cache.

Abstract: An embodiment of the invention, directed to assessing quality of recorded service data, comprises the step of receiving a record containing service data at a service record evaluator. The method further comprises selecting at least one information field of a plurality of information fields contained in the received record, and determining a numerical quality score for each selected information field. Each of the quality scores is used to compute a cumulative quality score for the record, and it is determined whether the cumulative quality score is no less than a minimum quality threshold.

Abstract: In a hierarchical profile, each node represents at least one feature of behavioral data collected about an entity profiled, with the topmost node selected as the “statistically most informative” feature of the data. A profile can cover numerous domains and be predictively very powerful in each domain. A number of observations can be “aggregated” together into a single datapoint. In use, the structure of the profile is compared against current information associated with the entity to produce a recommendation or prediction. If the profile represents at least some data aggregation, then new observations are folded into the profile based on statistical weights of the aggregations. Because of the way the profile is created and updated, its hierarchical structure maps the collected observations. Therefore, as new observations are incorporated, if the new observations change the profile's structure significantly, then it can be hypothesized that something “interesting” has happened to the entity.

Abstract: Example systems and methods of integrating data tags with their associated object data are presented. In one implementation, a data object employed in a first computer application is accessed. Examples of the data object include, but are not limited to, structured data and unstructured data. Tagging data that is descriptive of the first data object is also accessed. The tagging data is stored in at least one of the first data object and a separate data object linked with the first data object. The tagging data and the first data object are processed using a second computer application.

Abstract: Methods and apparatus, including computer program products, are provided for receiving an indication of a defined outer join to enable obtaining a first database table at a first database and a second database table at a second database; sending a first request to the first database to obtain the first database table; sending a second request to the second database to obtain the second database table; receiving, in response to the first and second requests, each of the first and second database tables; performing an outer join on the received first and second database tables, the outer join forming an output database table; and providing the output database table.

Abstract: A system may include display of a result set associated with one or more dimensions and one or more key figures, the result set comprising one or more members of each of the one or more dimensions and one or more values of each of the one or more key figures, reception of a selection of a portion of the result set, the portion associated with a first one or more of the one or more dimensions, a second one or more of the one or more key figures, and one or more rows of the result set, and storage of metadata defining the first one or more dimensions, the second one or more key figures, the one or more rows of the result set, and a condition, a schedule to evaluate the condition, and a notification type associated with the portion.

Abstract: In a hierarchical profile, each node represents at least one feature of behavioral data collected about an entity profiled, with the topmost node selected as the “statistically most informative” feature of the data. A profile can cover numerous domains and be predictively very powerful in each domain. A number of observations can be “aggregated” together into a single datapoint. In use, the structure of the profile is compared against current information associated with the entity to produce a recommendation or prediction. If the profile represents at least some data aggregation, then new observations are folded into the profile based on statistical weights of the aggregations. Because of the way the profile is created and updated, its hierarchical structure maps the collected observations. Therefore, as new observations are incorporated, if the new observations change the profile's structure significantly, then it can be hypothesized that something “interesting” has happened to the entity.