Abstract: A system and method for compressing that comprises establishing attributes or elements to build a schema that is utilized to generate a record that includes the connection descriptions, building a set of substitution rules by using range expressions and substitution variables, and utilizing the set of substitution rules to associate value assignments that compress the connection descriptions within the record.

Abstract: For digest retrieval based on similarity search in deduplication processing in a data deduplication system using a processor device in a computing environment, input data is partitioned into fixed sized data chunks. Similarity elements and digest block boundaries and digest values are calculated for each of the fixed sized data chunks. Matching similarity elements are searched for in a search structure containing the similarity elements for each of the fixed sized data chunks in a repository of data. Positions of similar data are located in the repository. The positions of the similar data are used to locate and load into the memory stored digest values and corresponding stored digest block boundaries of the similar data in the repository. The digest values and the corresponding digest block boundaries of the input data are matched with the stored digest values and the corresponding stored digest block boundaries to find data matches.

Abstract: Disclosed are computer implemented methods, computer program products, and computer systems for storing a file into a storage system. An embodiment includes, responsive to a determination that a descriptive information describing content of a first file corresponds to a descriptive information describing content of a second file, that a format of the first file is convertible to a format of the second file using a transformation matrix, and that the format of the first file has a higher quality indicator value than the format of the second file, storing the first file into the storage system.

Abstract: The present invention extends to methods, systems, and computer program products for selecting candidate records for deduplication from a table. A table can be processed to compute an inverse index for each field of the table. A deduplication algorithm can traverse the inverse indices in accordance with a flexible user-defined policy to identify candidate records for deduplication. Both exact matches and approximate matches can be found.

Abstract: Techniques to determine network storage for sharing media files are described. An apparatus may comprise a processor and a memory communicatively coupled to the processor. The memory may store an application having a media share component operative to receive a request to associate a media file with a document having a document network storage location. The media share component may comprise multiple software modules, including a file manager module. The file manager module may be operative to determine a media file network storage location for the media file based on the document network storage location. Other embodiments are described and claimed.

Abstract: Location graph-based derivation of user attributes is disclosed. In various embodiments, location data associated with a user, such as a current and/or past location at which the user has been, is received. A user attribute data associated with the location data is determined and used to update a user profile associated with the user.

Abstract: Embodiments of the present invention provide a novel and non-obvious method, system and computer program product for image annotation for image auxiliary information storage and retrieval. In an embodiment of the invention, a method for image annotation for image auxiliary information storage and retrieval is provided. The method includes loading a digital image into memory of a computer and selecting separately stored auxiliary information for the digital image. A network location of the auxiliary information can be encoded. Finally, the encoding can be embedded into the digital image.

Abstract: Systems, methods, and computer-readable storage media for an event-based photo view in a browser are disclosed. The system can receive a request to display a set of content items associated with a user account. The system can generate a web page based on a size of the set of files, the web page providing a continuous presentation of the set of files at the web page on a device, wherein a visible portion of the web page includes a presentation of files, and wherein the files are mapped to an area in the web page that is associated with a current position within the web page. The web page can include an events-based navigation feature. The system can transmit the web page to device for display at the device.

Abstract: Disclosed is a server that can perform a visual search using at least one rectified image. A method implemented at a server includes storing a plurality of images with the server, receiving at least one rectified image having at least one potential object of interest from a computing device for a visual search, and extracting descriptors representing features of the at least one rectified image. The extracted descriptors of the at least one rectified image are designed to be invariant to rotation, scale, and lighting without needing to be invariant to perspective or affine distortion.

Abstract: A method and apparatus may provision a new computer code file as an update or a new application for end nodes of a cloud computing system. The method and apparatus may receive a computer code file at a repository server via a portal interface to an automation service. The computer code file may include a discrete file or package of files corresponding to a complete application or an update for an application for execution on cloud computing system nodes. The method and apparatus may also receive provisioning conditions at the automation service via the portal interface, send the computer code file to the cloud computing system end nodes based on the received provisioning conditions, and cause the sent computer code file to be installed on each of the plurality of cloud computing system end nodes.

Abstract: Provided are a computer program product, system, and method for limiting the rendering of instances of recursive elements in view output. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. A condition is received for terminating recursion for the recursive element. A view is generated for the schema including information on the condition for terminating the recursion, wherein the processing of the view causes a parser to chunk instances of the recursive element in schema data in response to the condition indicating to terminate recursion at the level of the instance of the recursive element being processed.

Abstract: Methods and systems enable a database reorganization to occur without a database outage. In one aspect, the method includes pausing transactions directed to the database, keeping a logical view of the database online. The method may also include taking individual partitions offline, changing the names of datasets associated with the individual partitions in a database schema, and bringing the partitions online, all while the logical view of the database remains online. The database schema may be changed to reflect the name of datasets associated with a shadow copy of the database that has been reorganized.

Abstract: A method for enterprise application integration that uses “connectors” that can be instantiated via downloading (e.g., using Java® or other such technologies) to provide interfaces to respective disparate database systems. The databases systems may comprise any variety of now or heretofore known systems, e.g. SAP, Oracle, and so forth. The connectors can, for example, translate between a native language (or API) of the respective database systems and an internal language/protocol of the enterprise application integration system. To this end, the connectors can utilize a scripting language to access the respective database systems. Data retrieved from the database systems can be stored in a central data store in the form of RDF triplets, from which directed graphs can be generated for to generate presentations consolidated from the multiple database systems.

Abstract: A data normalization system is described herein that represents multiple data types that are common within database systems in a normalized form that can be processed uniformly to achieve faster processing of data on superscalar CPU architectures. The data normalization system includes changes to internal data representations of a database system as well as functional processing changes that leverage normalized internal data representations for a high density of independently executable CPU instructions. Because most data in a database is small, a majority of data can be represented by the normalized format. Thus, the data normalization system allows for fast superscalar processing in a database system in a variety of common cases, while maintaining compatibility with existing data sets.

Abstract: A database diagnostics system with an interface system that may be used to define, monitor, and deploy database diagnostics tools is presented. The interface system presents a user with a user interface for defining the parameters, behaviors, and schedules of database diagnostic tools. The diagnostic tools execute on a target database recording database parameters and state information. The interface system may present the user with a graphical user interface for assembling diagnostic tools at least partially from a predefined set of reusable modules and scripts.

Abstract: A cloud computing operating system is described. The system, in one aspect, includes a plurality of core data structures (100) each configured to define basic attributes that elements of the system contain. The system also including an indexing data structure (104) inherited from one of the core data structures (100) configured to index any number of core data structures (100) or elements inherited from a core data structure (100) and an encapsulating data structure (110) inherited from the indexing data structure (104) and configured to encapsulate any number of core data structures (100) or elements inherited from a core data structure (100). Each core data structure (100) is encapsulated within one encapsulating data structure and includes a reference to its encapsulating data structure. Other aspects of the cloud computing operating system are also described.

Abstract: Architecture that includes an index creation algorithm that utilizes available resources and dynamically adjusts to successfully scale with increased resources and be able to do so for any data distribution. The resources can be processing resources, memory, and/or input/output, for example. A finer level of granularity, called a segment, is utilized to process tuples in a partition while creating an index. The segment also aligns with compression techniques for the index. By choosing an appropriate size for a segment and using load balancing the overall time for index creation can be reduced. Each segment can then be processed by a single thread thereby limiting segment skew. Skew is further limited by breaking down the work done by a thread into parallelizable stages.

Abstract: An activity recognition system is disclosed. A plurality of temporal features is generated from a digital representation of an observed activity using a feature detection algorithm. An observed activity graph comprising one or more clusters of temporal features generated from the digital representation is established, wherein each one of the one or more clusters of temporal features defines a node of the observed activity graph. At least one contextually relevant scoring technique is selected from similarity scoring techniques for known activity graphs, the at least one contextually relevant scoring technique being associated with activity ingestion metadata that satisfies device context criteria defined based on device contextual attributes of the digital representation, and a similarity activity score is calculated for the observed activity graph as a function of the at least one contextually relevant scoring technique, the similarity activity score being relative to at least one known activity graph.

Abstract: Methods, systems and computer program products are provided for predicting data. A name or title is obtained from a taste profile. There is an index into a data set based on the name or title, and a set of terms and corresponding term weights associated with the name or title are retrieved. A sparse vector is constructed based on the set of terms and term weights. The sparse vector is input to a training model including target data. The target data includes a subset of test data which has a correspondence to a predetermined target metric of data. A respective binary value and confidence level is output for each term, corresponding to an association between the term and the target metric.

Abstract: A system and method for performing similarity searching is disclosed wherein programmable logic devices such as field programmable gate arrays (FPGAs) can be used to implement Bloom filters for identifying possible matches between a query and data. The Bloom filters can be implemented in a parallel architecture where the different parallel Bloom filters share access to the same memory units.

Abstract: Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table.

Abstract: An enterprise data processing module and method are described herein. The enterprise data processing module comprises at least one collector and at least one analyzer. The collectors may be operable to collect data pieces from a plurality of data sources. The analyzers may be operable to analyze the collected data pieces to determine cross-source relationships that exist between the data pieces collected from the plurality of sources. The analyzed data pieces may be stored in one or more big-data databases as blocks of data according to the cross-source relationships.

Abstract: This application relates to features for a mobile device that allow the mobile device to assign utility values to applications and thereafter suggest applications for a user to execute. The suggested application can be derived from a list of applications that have been assigned a utility by software in the mobile device. The utility assignment of the individual applications from the list of applications can be performed based on the occurrence of an event, an environmental change, or a period of frequent application usage. A feedback mechanism is provided in some embodiments for more accurately assigning a utility to particular applications. The feedback mechanism can track what a user does during a period of suggestion for certain applications and thereafter modify the utility of applications based on what applications a user selects during the period of suggestion.

Abstract: Disclosed herein are systems, computer-implemented methods, and tangible computer-readable media for representing media assets. The method includes receiving an original media asset and derivative versions of the original media asset and associated descriptors, determining a lineage to each derivative version that traces to the original media asset, generating a version history tree of the original media asset representing the lineage to each derivative version and associated descriptors from the original media asset, and presenting at least part of the version history tree to a user. In one aspect, the method further includes receiving a modification to one associated descriptor and updating associated descriptors for related derivative versions with the received modification. The original media asset and the derivative versions of the original media asset can share a common identifying mark.

Abstract: Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record and a deleted version of the data store record in the case of a delete in the data store. The instance of the data store operation statement is correlated with the new version of the data store record or the deleted version of the data store record.

Abstract: A method may include applying periodically a data validation rule to data transformed through a data processing system, wherein the data validation rule applies aspects selected from a group consisting of data value range, specific data values, and relationship with other data entries; responsive to detecting a violation of the data validation rule, identifying a portion of the transformed data for lineage assessment; examining the identified transformed data iteratively upstream at a previous transformation node in a lineage graph, until the method detects a node where the violation of the data validation rule can't be reproduced; creating a separate node in a distributed network for each of the previous transformation nodes in the lineage graph; and identifying the separate node in the distributed network introducing the violation of the data validation rule.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a source independent query language. One of the methods includes receiving a first executable statement, the first executable statement referencing a second set of fields in a dataset, the first executable statement having instructions to cause the query processor to perform operations on data in the dataset. The method includes Generating a second executable statement based on the first set of fields and the first executable statement. The method includes determining a mapping between the first set of fields and the second set of fields. The method includes specifying a derived dataset using the corresponding values and the mapping. The method includes generating instructions to cause the query processor to perform the operations on the derived dataset. The method includes sending the second executable statement to the query processor.

Abstract: A service provision method is provided for user search, and an apparatus, a server, and a system for the same. A service provision method includes transmitting a terminal search request message including a contents information element to a service provision server, receiving positional information of a terminal, which is playing first contents related to the contents information element, from the service provision server, and displaying the received positional information.

Abstract: Embodiments regard security descriptors for record access queries. An embodiment of a method includes: receiving a record access query, the query regarding records for a certain one or more users, groups, or both at a certain access level; searching one or more sharing tables of entities in a computing environment for security descriptors, each security descriptor being associated with a set of one or more users, groups, or both having access to one or more records of a set of records at an access level; identifying any security descriptors in the one or more sharing tables that relate to the certain one or more users, groups, or both with at least the certain access level; and searching the one or more records associated with each of the identified security descriptors according to the record access query.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for natural language processing. One of the methods includes receiving a search query from a user during a user session; obtaining a plurality of prior search queries by the user received during the user session; generating a plurality of candidate query rewrites, wherein the candidate query rewrites are derived from the search query and the plurality of prior search queries by the user; scoring each candidate query rewrite, wherein scoring each candidate rewrite includes determining a quality of each candidate query rewrite based on an analysis of search results responsive to the candidate query rewrite; selecting a candidate query rewrite having a score that satisfies a threshold value; and providing search results responsive to the selected candidate query rewrite.

Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

Abstract: Disclosed are methods for creating, applying, using and retrieving profile information that includes attributes that may be stored separately from, or with, the content to which the profiles are being applied. In this manner, profiles can be shared in various environments and across various applications. Attributes that have corresponding attributes in other content can be applied to the other content, as long as each of the attributes is valid. In vehicle applications, the profile can be generated in a first vehicle, stored in a profile repository, and subsequently applied to a second vehicle.

Abstract: Systems and techniques for searching multiple data sources are described herein. Users may specify searches of multiple data sources to occur on a periodic basis. The searches may be configured to search time or date ranges that have not previously been searched. A user may select the data sources of interest and specify search terms, review and edit previously created searches, and review results of searches. The system automatically performs the specified searches, and notifies the user and/or a team of the user each time new results are found. The system may efficiently search the data sources by storing previous search results and comparing the previous results to current search results to identify new search results.

Abstract: Systems and methods for aggregated search are provided. A user using a client device may provide a search request concerning a file hosted at a remote host. It is determined that the client device has an open session with each of a plurality of remote hosts. Search commands are generated and sent to the remote hosts. Such search commands may be based on an application programming interface specific to the particular remote hosts. Search results may be received from the remotes hosts. The search results may then displayed on the client device in a consolidated list, which may be sorted according to any parameter selected by the user and/or known in the art.

Abstract: Among other things, one or more techniques and/or systems are provided for developing a timeline chronicling events pertaining to an industrial asset. Data is received from a plurality of assets, processed (e.g., to reduce duplicative and/or redundant data), and organized chronologically for presentation in a timeline. The data is further grouped and/or prioritized to display some portions of the data more prominently relative to other portions of the data in the timeline (e.g., which may be hidden). Grouping rules and/or prioritization rules for grouping and/or prioritizing the data may be a function of user interaction with the timeline and/or a function of a machine learning algorithm which may be configured to identify patterns in how users interact with the timeline based upon, among other things, a role the user plays relative to the industrial asset and/or an operating state of the industrial asset.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, including a method for ranking content using location-based query log analysis. The method comprises: identifying a region defining an area of interest including identifying a plurality of content items that are associated with the region; evaluating query logs associated with users that submitted queries associated with the region to determine a ranking associated with the plurality of content items; receiving a request for content associated with the region; and providing one or more of the content items based at least in part on the ranking.

Abstract: In one aspect, a method is provided, including the following method operations: receiving a request to generate a first post data item for display at a first location, the first post data item including a reference to a content item located at a second location; determining, based on the reference to the content item, a content identifier associated with the content item; associating the content identifier with the post data item; retrieving one or more post data items based on the content identifier and displaying the one or more post data items at the second location, the one or more post data items including the first post data item.

Abstract: Systems and methods are disclosed for determining media consumption preferences. A method may include accessing media consumption history associated with a user. The media consumption history may include at least one of media purchase history of the user, media viewing history of the user, and media listening history of the user. A media category preference of the user may be determined, based on the media consumption history. The media category preference may include a popularity indication for each of a plurality of media categories of media items in the media consumption history. Search results provided in response to a search query by the user and/or media recommendations prepared for the user may be scored based on the media category preference. The media may include a video, a movie, a TV show, a book, an audio recording, a music album and/or another type of digital media.

Abstract: Embodiments are directed to establishing a metadata repository that aggregates metadata for a plurality of data sources, inferring data source metadata at a metadata repository and to providing recommendations to data managers based on aggregated inputs. In one scenario, a computer system establishes a reference to one or more data sources, where each data source includes data elements. The computer system receives a data request for specified data elements stored on the data sources and accesses the established references to determine which data source the specified data elements are stored on. The computer system then retrieves at least one of the specified data elements from its determined data source and sends the retrieved data elements to a specified computer system, along with an indication of additional data elements that are relevant to the received data request, and a further indication of how those additional data elements are to be accessed.

Abstract: Provided is a method comprising: maintaining forward network structure information that, with stages arranged in a multilayer structure and each stage including one or more nodes associated with one or more words and associated in whole or in part with a point, connects nodes included in different layers with each other, in order from a higher layer toward a lower layer in a network state; acquiring one or more search word to use for a search; acquiring a node including all or part of the acquired search words and converting the acquired search words into a point; and using the forward network structure information to calculate points by sequentially adding together in a manner to inherit points, in node units of each layer, the points associated with the acquired node along all paths connected by these points from a topmost layer to the node of a predetermined layer.

Abstract: Methods and systems for discovering and exploring feature knowledge included in large corpora are disclosed. The described systems and methods may include the application of in-memory analytics to records, where the analytic methods applied to the records and the level of precision of the methods may be dynamically selected by a user.

Abstract: An approach for validating code for an extract, transform and load tool is provided. Naming, coding, and performance standards for the code are received. The code is exported to a job definition file and parsed. Violations of the standards are determined by a mismatch between the parsed code and the standards. A report identifying the violations is generated. Based on a review of the report and a rework of the code to comply with the standards, the reworked code is exported to another job definition file and parsed, and subsequently is determined to not include the violations of the standards. A second report is generated that indicates the reworked code does not include the violations. An approval of the reworked code is received based on the second report. Based on attributes of a job included in the code, a violation of one of the performance standards is determined.

Abstract: Methods and systems for efficient file replication are provided. In some embodiments, one or more coarse signatures for blocks in a base file are compared with those coarse signatures for blocks of a revised file, until a match is found. A fine signature is then generated for the matching block of the revised file and compared to a fine signature of the base file. Thus, fine signatures are not computed unless a coarse signature match has been found, thereby minimizing unneeded time-consuming fine signature calculations. Methods are also provided for determining whether to initiate a delta file generation algorithm, or whether to utilize a more efficient replication method, based upon system and/or file parameters. In accordance with additional embodiments, the lengths of valid data on physical blocks are obtained from physical block mappings for the files, and these lengths and mappings are utilized for delta file generation, to minimize unnecessary signature computations.

Abstract: To synchronize data stored by a first device (e.g., a client system) with data stored by a second device (e.g., a server system), the first device encodes a first set of ordered data identifiers, stored in memory of the first device, to produce an encoded value, wherein the first set of ordered data identifiers is bound in accordance with a range indicator, and transmits the encoded value and the range indicator to the second device. The first device subsequently receives from the second device a remedial set of ordered data identifiers stored in memory of the second device when the encoded value does not match a corresponding value determined by the second device, wherein the remedial set of ordered data identifiers is also bound in accordance with the range indicator.

Abstract: A method and apparatus for distribution of applications amongst a number of servers, ensuring that changes to application data on a master for that application are asynchronously replicated to a number of slaves for that application. Servers may be located in geographically diverse locations; the invention permits data replication over high-latency and lossy network connections and failure-tolerance under hardware and network failure conditions. Access to applications is mediated by a distributed protocol handler which allows any request for any application to be addressed to any server, and which, when working in tandem with the replication system, pauses connections momentarily to allow seamless, consistent live-migration of applications and their state between servers.

Abstract: The disclosed embodiments relate to a system that uses colocation hints to facilitate storing data blocks in a distributed data storage system, which includes a plurality of data centers. During operation, the system receives a write request from a client to write a data block to the distributed data storage system, wherein the write request includes a colocation hint that identifies a colocation group associated with the data block. In response to the write request, the system uses the colocation hint to identify one or more data centers associated with the colocation group. Next, the system writes copies of the data block to the one or more identified data centers. In this way, the system situates copies of data blocks associated with the colocation group in the same data centers when possible.

Abstract: For synchronizing replication status, a copy module continuously replicates data from a first device designated with a device status of primary to a second device designated with a device status of secondary. A first peer-to-peer remote copy (PPRC) relationship is established between the first and second devices. The first and second devices store replication information comprising a bitmap with a replication status for each data block of the first device. The copy module further copies an instant point-in-time copy of the data from the second device to a copy device. In addition, the copy module copies the replication information from the second device to the copy device and links the replication information of the second device and copy devices.

Abstract: A licensing service for a data repository, including software instructions to perform: dividing a data store into a plurality of domains; assigning a license number to at least one of the plurality of domains; and checking a license of a user with the assigned license number. A method to expedite license checking by statistically sampling a subset of probes to check the license. A method for allowing a third party application to access a data store without a license, including: assigning a license management tool feature name to the third party application; adding the license management tool feature name to a program in the data store; starting a session of the third party application; having the third party application call an embedded licensing application program interface; and checking the license using the embedded licensing application program interface.

Abstract: A server determines whether a the stored on a computing device matches a file stored on the server by comparing hash values for a first portion of the files. Based on the comparing, the server determines whether to upload the first portion of the file. The server uploads second portion of the file. The server generates the file for download by appending the first portion of the file stored on the server to the second portion of the file uploaded from the computing device.

Abstract: Cycles and other patterns within time-series data are determined. Time-series data are transformed into discretized sets of clustered data that are organized by time period. Comparison is made of the organized data to determine similar time periods and multiclusters of the similar time periods are formed. From the multicluster data, cycles are identified from which thresholds and other useful data may be derived, or the data used for other useful purposes.