Abstract: Techniques are described for identifying conflicts between a prospective temporal key and an index of temporal keys, the index sorted based on a time value associated with each of the temporal keys. Embodiments determine whether a first temporal key within the index of temporal keys conflicts with the prospective temporal key. Here, the keys within the index may be sorted based upon a respective time value associated with each of the keys. Upon determining that the first temporal key conflicts with the prospective temporal key, the prospective temporal key is designated as conflicting with at least one existing temporal key in the index of temporal keys.

Abstract: A method, apparatus, and non-transitory computer readable storage medium for validating content is provided. Data is parsed into at least a first group of data and a second group of data according to a plurality of types of content present in the data. The data is ingested into an associative memory. The associative memory forms a plurality of associations among the data. The associative memory is configured to be queried based on at least one relationship selected from a group consisting of direct relationships and indirect relationships among the data. The associative memory comprises a content-addressable structure, the content-addressable structure comprising a memory organization in which the data is configured to be accessed by the content as opposed to being configured to be accessed by addresses for the data. The first group of data and the second group of data are communicated in a graphical representation.

Abstract: Various technologies and techniques are disclosed for integrating structured accounting data with unstructured data. From an application that manages structured accounting data related to an entity, a user selection is received to create a document container for a collaboration tool. The document container is used for storing unstructured data related to the entity. In response to the selection of the create option, a site creation service is launched for automatically creating the document container using settings previously specified by an administrator on a configuration screen of the application. Once the document container is created, unstructured data related to the entity is stored in the document container. The user can view and navigate between the structured accounting data and unstructured data without having to leave the application. Unstructured data is automatically published to the document container for the entity as users interact with the application.

Abstract: The saving device for image sharing includes an image acquiring unit configured to acquire the images offered by a sharer of the images, a sharee information storing unit configured to store sharee information with respect to at least one sharee, a subject assessing unit configured to assess whether or not a person subject is included in the acquired images, an image associating unit configured to associate the images assessed as not including a person subject with the images assessed as including a person subject, based on the sharee information, and a shared image determining unit configured to determine the images to be shared with the sharee or sharees from among the associated images and the images assessed as including a person subject, based on the sharee information. The image sharing system and an image sharing method use such a device.

Abstract: Delivering a search result is disclosed. A category is associated with a document based at least in part on one or more scores that measure the relevance of that document to a base category. A search query is obtained. One or more results is delivered in a manner that includes an indication of at least one category with which the result is associated.

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

Abstract: Techniques are described for refining the manual classification of assets classified or categorized using the terms of a business glossary. A semantic refinement mechanism is used to refine the manual classification of such assets, as well as subsequently evaluate the refined asset classifications. Further, the refined asset classifications may be used as a training set for a machine learning classifier. That is, should the classification of an asset contributing to a refinement change, the refinement based on that classification may be undone, at least in some cases.

Abstract: According to exemplary embodiments, a method and system for generating binary Extensible Markup Language (XML) data is provided. The generating includes acquiring an XML data source and generating a first child distance (FCD) token and a next sibling distance (NSD) token of an element node in the XML data source. The generating also includes generating binary XML data of the XML data source by using the FCD token and the NSD token, where the binary XML data includes the FCD token and the NSD token.

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application.

Abstract: A user selection of a link on a first webpage that is being displayed is received. A copy of the first webpage is stored in cache memory at a local client machine. Responsive to receiving the user selection of the link: the copy of the first webpage stored in the cache memory is modified at the local client machine to include metadata associated with the user selection of the link on the first webpage; and a second webpage associated with the link is presented. A request to reload the first webpage is received. Responsive to receiving the request to reload the first webpage: the metadata from the first webpage stored in the cache memory is obtained; a third webpage based on the metadata is obtained; and the third webpage is displayed.

Abstract: This disclosure enables a user to incrementally increase or decrease the size of the cluster and, in particular, to incrementally increase or decrease the number of map regions implemented in a metadata manager associated with the cluster while maintaining availability of the cluster. In a representative embodiment, a configurable target map size is identified, either manually (e.g., by the user) or programmatically. If the target map size is found to be within an acceptable value (given the available node configuration), a procedure to create a new map is triggered. The new map preferably is generated as follows. Initially, one or more new temporary region(s) are created either to split or join the existing regions (depending on whether the map is being increased or decreased). For each temporary region, the process also generates MDPL backup regions. Metadata from an original region (or regions) is then migrated to the temporary region(s).

Abstract: Systems, methods and techniques for managing data sets are described. In particular, systems and methods for modeling, representing, acquiring and disseminating large data sets and data files using metadata are described. The large data sets may include geospatial information. The metadata may be extracted from the data or provided separately. Such metadata may be used to represent the underlying data so as to avoid unnecessary and/or unwanted transfer, exposure or manipulation of the underlying data. The metadata may be represented in a static or dynamic fashion, and may be shared via, for example, social media networks and the like.

Abstract: A system and method for data storage by shredding and deshredding of the data allows for various combinations of processing of the data to provide various resultant storage of the data. Data storage and retrieval functions include various combinations of data redundancy generation, data compression and decompression, data encryption and decryption, and data integrity by signature generation and verification. Data shredding is performed by shredders and data deshredding is performed by deshredders that have some implementations that allocate processing internally in the shredder and deshredder either in parallel to multiple processors or sequentially to a single processor. Other implementations use multiple processing through multi-level shredders and deshredders. Redundancy generation includes implementations using non-systematic encoding, systematic encoding, or a hybrid combination.

Abstract: Embodiments are directed towards managing within a cluster environment having a plurality of indexers for data storage using redundancy the data being managed using a generation identifier, such that a primary indexer is designated for a given generation of data. When a master device for the cluster fails, data may continue to be stored using redundancy, and data searches performed may still be performed.

Abstract: A system is described for creating compact aggregation working areas for efficient grouping and aggregation using multi-core CPUs. The system implements operations including computing a running aggregate for a group within a business intelligence (BI) query, and identifying a location to store running aggregate information within an aggregation working area of a cache. The aggregation working area includes first and second data structures. The first data structure stores running aggregate information that is associated with a group that is accessed frequently relative to a threshold. The second data structure stores running aggregate information that is associated with a group that is accessed infrequently relative to the threshold. The operations also include storing the running aggregate information in either the first or second data structure of the aggregation working area based on a characterization of the group as a frequently or infrequently accessed group.

Abstract: Techniques for providing a consolidated view of directory changes across different directory servers. In one set of embodiments, a changelog record can be received from a directory server, where the directory server is associated with a proprietary changelog format, and where the changelog record is formatted according to the proprietary changelog format. The received changelog record can then be translated into a virtualized changelog record that is formatted according to a standard changelog format, and the virtualized changelog record can be sent to a consuming client. With this virtualization capability, the client does not need to be concerned with, or even aware of, the proprietary changelog mechanisms/formats that may be used by different directory servers in a multi-server deployment.

Abstract: Methods and systems for detecting anomalies in sets of data are disclosed, including: computing components of one or more types of feature vectors at a plurality of values of one or more independent variables, each type of the feature vectors characterizing a set of input data being dependent on the one or more independent variables; computing one or more types of output values corresponding to each type of feature vectors as a function of the one or more independent variables using a nonlinear sequence analysis method; and detecting anomalies in how the one or more types of output values change as functions of the one or more independent variables.

Abstract: A method for synchronizing a database with data stored at a client includes providing a data feed to receive data by the client from the database and provide received data, caching the received data in a client side cache to provide client side cached data, detecting a database change to data within the database corresponding to the client side cached data according to a polling operation to provide a change event, pushing the change event to the client side cached data to update the client side cached data in accordance with the database change and the polling operation, requesting further data from the database, determining whether the further data includes data of the client side cached data to determine remaining data exclusive of the client side cached data and pushing the remaining data to the client side cached data.

Abstract: Aspects of the invention relate to the use of electronic maps and providing information about intersecting streets. A given region of interest on a map may include any number of features. Features of interest, including road segments and intersections, can be filtered to remove non-street data. The results may be analyzed according to individual street segments. Each segment may be identified by a feature ID, and the relationship each segment has with a given intersection is analyzed. Thus, the direction of a segment into or out of an intersection is determined, along with the physical locations of the beginning and end of the segment. This information is used to provide robust map information that may be displayed to a user. Heuristics can be applied to the map information to provide coherent address or direction information to the user for a given point of interest.

Abstract: Information that maps a point in XML document structure to a name of a variable and an EXI grammar form that includes grammars each defining relationship among an event representative of an element in the XML document structure, an EXI event code, and a next grammar for use are read. A selecting unit selects grammars in the EXI grammar form such that the grammars are traced in sequence. A determining unit updates a grammar stack which identifies a current position in the XML document structure each time a grammar is selected. If the updated stack does not indicates the point, a function setting unit sets a skip function for skipping a corresponding value in an EXI stream, otherwise, sets a read function for reading and providing the corresponding value to a corresponding variable. A composer generates an EXI decoder including skip and read functions set for individual grammars.