Abstract: Disclosed herein is a system and method that can be used to synchronize files from a hosted file system where the client endpoint devices have direct access to the files stored on a hosted file store/system. When the client synchronizes with the files stored on the hosted file store the synchronization process identifies the files that need to be synchronized with the client and prepares batches of files to be synced. During the process of synchronization the files are not locked from other user's being able to use the files. If the file is modified by another endpoint during the file synchronization process the file will not be synchronized with the client device during the particular synchronization process. In this way synchronization becomes possible with the hosted service without impacting the performance of other devices that use and access the data in the hosted file store.

Abstract: Disclosed are some examples of database systems, methods, and computer program products for processing log files. In some implementations, a server of a database system accesses a metadata file indicating algorithms that can be applied to data of log files. The server generates customer-facing log files using the log file and metadata file. The customer-facing log files include new data derived from using the algorithms and the data of the log files.

Abstract: Embodiments of a distribution management system are disclosed. In some embodiments, a distribution management system enables to effectively provide geographic information system (GIS) data regarding an electric power application model applied to a supervisory control and data acquisition (SCADA) system using an international electrotechnical commission (IEC)-61968 standard, is a distribution management system based on IEC-61968, includes a GIS tool for generating GIS schema data, a GIS transfer unit for receiving the GIS schema data to transform the received GIS schema data into a format suitable for a standard, and one or more GIS distribution management applications connected to the GIS tool to receive the GIS schema data.

Abstract: Geotagging techniques allow automatic playback of media items based on position. Tagged items can be presented automatically in response to establishing network communications between two devices.

Abstract: A computer program product for managing and rendering one or more information nodes relative to a current focus. The computer program product receives one or more principal topics from an analysis of the information nodes. The computer program product determines a topic vector from a similarity of a first information node to each of the principal topics and a map from the topic vector to a storage location of the first information node. The computer program product determines one or more current topics from a second information node that has been recently accessed by a user and a current focus vector from a similarity of the one or more current topics to the one or more principal topics. The computer program product renders the current focus vector and the first information node according to a rendering algorithm that is applied to the current focus vector and the first information node.

Abstract: There is disclosed a method and device for operating an image database shared by a plurality of users. In an embodiment, each image captured by a user and stored in a shared image database is associating with the geographic coordinates of the location at which the image was captured. A search engine for the image database is configured to accept geographic coordinates as a search criterion for locating at least one captured image stored in the shared image database. The images having location coordinates within a predefined range of geographic coordinates is displayed to the user.

Abstract: Described are systems, media, and methods for discovery of media relevant to a user and sharing the media with the user.

Abstract: Systems and methods for detecting near-duplicate images using triples of adjacent ranked features (TARFs). An example method may include: identifying a plurality of TARFs associated with a query image, wherein each TARF comprises a blob feature point and two corner feature points; identifying, using an index of a corpus of images, an at least one candidate image having at least one TARF matching a TARF of the plurality of TARFs associated with the query image; and responsive to evaluating a filtering condition, identifying the candidate image as a near-duplicate of the query image.

Abstract: The present inventive subject matter relates to prior art analysis. Various embodiments of the present inventive subject matter include systems and methods for analyzing prior art in a patent portfolio and annuity management system. In an example embodiment, a method comprises maintaining a patent matter database. The database includes data about the patent matters including for at least one patent matter a claim set or statement of invention and a priority date for the claim set or statement of invention. A database of prior art documents is maintained including data about the prior art documents. The data may include for at least one prior art document a priority date or publication date of the document. A keyword analysis is performed on a given patent matter and associated prior art documents to identify keywords occurring uniquely in the first patent matter as potential claim elements differentiating the patent matter over the disclosures contained in the one or more prior art documents.

Abstract: Embodiments for an approach to managing a relational database. The relational database comprises a first table defining a primary key, and at least one other table with a foreign key constraint referencing the primary key. The data of the first table and at least one other table is divided into a plurality of partitions, each containing data associated with a subset of primary key values. Receiving a partition management policy, defining one or more conditions for the first table and at least one other table and an operation performed on the partitions of the first table and at least one other table. Determining if the first table and at least one other table satisfy the one or more conditions of the partition management policy, if not, performing the operation.

Abstract: A method for deleting a row from a table in a database system comprises logically deleting the row in the first table in the database system by inserting a key of the row into a corresponding row of a dedicated table in the database system; querying the dedicated table during a query against the first table to identify the corresponding row in the dedicated table; and in response to identifying the corresponding row in the dedicated table, deleting the row from the first table and the corresponding row from the dedicated table as part of query processing during a subsequent query.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for log storage optimization by receiving log data, s converting the log data into structured data using a parsing rule, and encoding the structured data to reduce a storage space of the log.

Abstract: Aggregations of data items which are components of a data set may be performed in a single iteration pass through selector components of an item vector. The item vectors may have an item vector structure whose components comprise numerical identifiers of selectors associated with one or more items. The selectors may be data values which are components of the data set.

Abstract: A method includes storing data entities in data storage blocks, a logical structure of the storage of the data entities in the data storage blocks is a database including the data entities stored in tables, receiving a request message including an instruction to execute operations using data of the data entities being logically stored in one or more rows of the data entities in the table and physically stored in the data storage blocks of a processing set, determining that the data entity to be used for execution of the operations is stored across the data storage blocks, generating a processing subset in response to the determining that the data entity is stored across the data storage blocks, and executing the operations using a portion of the data stored in the processing subset.

Abstract: A computer-implemented linking system and method provide for linking actionable phrases in a first document to other documents in a document corpus. The method includes identifying at least one actionable phrase in a first document. The actionable phrase may include an action, its direct object, and any modifier of the direct object. For each identified action phrase the document corpus is searched to identify other documents, which are scored using a scoring function which takes into account occurrences of words of the actionable phrase in each identified document. The actionable phrase is linked to at least a part of one of the most highly ranked documents in the set of documents.

Abstract: A system, computer-implemented method, and computer-program product embodiments for rebuilding database indexes is disclosed. A pre-loader thread rebuilds a plurality of indexes in the background once a database is initialized. Simultaneously, a query processor receives queries from a user/client of a database. If an index that is required by the query processor has not yet been rebuilt by the pre-loader, a request to rebuild the index is sent to an asynchronous index loader. The asynchronous index loader places the request in a queue, processes the queue based on available system resources, and then rebuilds the requested indexes. Once the necessary indexes have been rebuilt, a wake-up signal is sent to the query processor which then proceeds to execute the query from a user/client.

Abstract: A method includes storing data entities in data storage blocks, a logical structure of the storage of the data entities in the data storage blocks is a database including the data entities stored in tables, receiving a request message including an instruction to execute operations using data of the data entities being logically stored in one or more rows of the data entities in the table and physically stored in the data storage blocks of a processing set, determining that the data entity to be used for execution of the operations is stored across the data storage blocks, generating a processing subset in response to the determining that the data entity is stored across the data storage blocks, and executing the operations using a portion of the data stored in the processing subset.

Abstract: Systems and methods described herein generally relate to storing and verifying data. In some embodiments, reference levels are generated according to time intervals, where the first reference level comprises a predetermined number of the time intervals, and where each of the time intervals of the remaining reference levels is comprised of a predetermined number of the time intervals of a previous reference level. Hashes of data can be created at the first reference level by performing a hashing function on the data in a time-sequenced manner. First reference level time interval hashes may be generated by performing the hashing function on the hashes of the data at each of the time intervals of the first reference level. Hashes for remaining reference level time intervals can be generated by performing the hashing function on the hashes of each of the time intervals of the previous reference level.

Abstract: Various techniques are described for precisely locking database objects within a database during a system upgrade with the use of database freeze triggers. Some database freeze triggers can be utilized to lock transport requests while other database freeze triggers can be utilized to lock database objects such as exchange tables. For transport requests, techniques describe the use of a whitelist identify transport objects or transport object types which shall remain unblocked. As a result, a database freeze trigger can be generated for transport objects or transport object types that are not included in the whitelist. For database objects, techniques describe the identification of a tool or service which has been allowed during the upgrade. Database objects which can be modified during execution of the tool or service can be identified. Database freeze triggers can be generated for the database objects besides those identified.

Abstract: A method for deleting a row from a table in a database system comprises logically deleting the row in the first table in the database system by inserting a key of the row into a corresponding row of a dedicated table in the database system; querying the dedicated table during a query against the first table to identify the corresponding row in the dedicated table; and in response to identifying the corresponding row in the dedicated table, deleting the row from the first table and the corresponding row from the dedicated table as part of query processing during a subsequent query.

Abstract: A method and apparatus is presented for reaching consensus on adding data to a distributed ledger system in which no central trusted authority is available, comprising sending an announcement message by a network connected device to a plurality of network connected devices over a peer-to-peer network, said message providing an identification of the network connected device using a public key of a public/private key pair, a unique address identifier, and a hash. Subsequently, after a waiting period measured in, for example, time or blocks of data, the network connected device may submit data for inclusion in the distributed ledger. If the announcement message and preceding data in the distributed ledger satisfy a predetermined condition, the plurality of network connected devices may include the data in the distributed ledger. If the network connected device fails to submit the data when the predetermined condition is satisfied, the announcement message may be canceled.

Abstract: A method for obtaining and storing monitoring information. The method includes one or more computer processors generating a plurality of data records, based at least in part on a configuration for generating information, wherein the plurality of data records includes a first data record. The method further includes determining that a configuration for analyzing information dictates an analysis of at least a one data record, wherein the at least one data record includes a second data record. The method further includes determining that the plurality of data records do not include the second data record. The method further includes modifying the configuration for generating information to include generating the second data record. The method further includes generating an updated plurality of data records based on the modified configuration for generating information, wherein the updated plurality of data records includes the first data record and the second data record.

Abstract: A database operation is initiated in an in-memory database that stores persistent data in a secondary storage and has at least one associated log. The database operation involves data having a size above a pre-defined threshold. Thereafter, the data is split into a plurality of chunks and the database operation is executed by parallelizing each chunk over a plurality of hierarchically arranged threads. Related systems, apparatus, methods and computer program products are also described.

Abstract: A platform for socializing devices includes a knowledge database, a rules database, an event processor, an event queue, an advocate message processor, and an advocate message queue. A plurality of software advocates, each corresponding to a respective one of the devices, resides on the advocate message processor. The knowledge database includes a plurality of private social graphs, each corresponding to a respective one of the advocates. A policy database includes rules governing the relationships between and among the advocates and devices. The event processor is configured to process incoming payloads based on the knowledge database and the policy database.

Abstract: Methods, systems, and computer-readable media for digital document management. A physical context can be identified, wherein such a physical context includes three dimensions of data. One or more digital documents can be automatically linked to the physical context, after identifying the physical context. Constraints can then be combined, which are derived from the three dimensions of data, allow particular actions with respect to the digital document(s). The three dimensions of data include, for example, data indicative of location, time, and a social component (e.g., people present at a location). Actions with respect to the digital document can include, for example: an allowed action, a restricted action, or a prohibited action (e.g., read/write).

Abstract: Fault tolerant querying of data distributed across multiple nodes is accomplished by each node determining and reporting its own health status and indexing status to the other nodes in the cluster via a gossip protocol. A coordinator node then prioritizes replica nodes based on the received status of the other nodes and sends query requests to those nodes based on the prioritization. Should a node fail to provide an response to a query request, further query requests are sent to a next highest priority replica node containing the relevant data. This results in improved query performance by avoiding busy nodes and further provides a fault tolerant approach to data queries.

Abstract: A data object content verification technique provides perfect reliability and low storage overhead. Object data is generated in a reproducible manner based upon object locally stored object metadata. The object data is stored to an object storage system. The stored object data is subsequently verified by retrieving the object metadata, regenerating the original object data, and comparing the stored and original object data.

Abstract: A method for validating data changes made to a database is disclosed. The changes are made in the context of a transaction, and validation is performed using a rules database storing a plurality of rules. The method includes identifying a set of data entities affected by one or more data changes made in the context of the transaction. In response to an instruction to commit the transaction, data entities in the set of affected data entities are validated using rules from the rules database. The transaction is committed in dependence on the outcome of the validation.

Abstract: A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. Attribute values may be scalars or sets of numbers or strings. The system may provide an API usable to request that values of one or more of an item's attributes be updated. An update request may be conditional on expected values of one or more item attributes (e.g., the same or different item attributes). In response to a request to update the values of one or more item attributes, the previous values and/or updated values may be optionally returned for the updated item attributes or for all attributes of an item targeted by an update request. Items stored in tables may be indexed using a simple or composite primary key.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: A search and find user interface is provided that is integrated with a data indexing engine to allow efficient and high-speed data search and retrieval across data storage folders associated with a given software module or associated with a number of disparate software modules. An expanded form of the search and find user interface is provided for advanced searching. Where searching is required beyond a present search scope, an automatic “upscoping” mechanism is provided for expanding a search to data storage folders outside a current data storage folder on which an initial search is executed.

Abstract: Systems, methods, and computer storage media for handling failures in generating structured queries from natural language queries. One of the methods includes obtaining, through a natural language front end, a natural language query from a user; converting the natural language query into structured operations to be performed on structured application programming interfaces (APIs) of a knowledge base, comprising: parsing the natural language query, analyzing the parsed query to determine dependencies, performing lexical resolution, forming a concept tree based on the dependencies and lexical resolution; analyzing the concept tree to generate a hypergraph, generate virtual query based on the hypergraph, and processing the virtual query to generate one or more structured operations; performing the one or more structured operations on the structured APIs of the knowledge base; and returning search results matching the natural language query to the user.

Abstract: According to an embodiment of the present invention, methods, systems, and computer readable media are provided for collecting statistics for use in optimizing a database query. Collected statistics for the database are compared to corresponding predetermined states of conditions for optimizing the database query. One or more collected statistics in compliance with the corresponding predetermined states of conditions are identified based on the comparison. Collection of the one or more identified statistics for the query optimization is disabled.

Abstract: A database system includes a first information processing device that accesses a first database, and a second information processing device that accesses a second database that is a standby system of the first database, wherein the first information processing device includes a processor that executes a process including transmitting to the second information processing device a query corresponding to regeneration target execution plan information among items of execution plan information for access to the first database, and the second information processing device includes a processor that executes a process including updating first information indicating characteristics of the second database in response to updating of data of the second database, regenerating the regeneration target execution plan information, based on the first information and the query, and transmitting the regenerated execution plan information to the first information processing device.

Abstract: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

Abstract: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

Abstract: Roughly described, a system for user identification of a desired document. A database is provided which identifies a catalog of documents in an embedding space, the database identifying a distance in the embedding space between each pair of documents corresponding to a predetermined measure of dissimilarity between the pair of documents. The system presents an initial collection of the documents toward the user, from an initial candidate space which is part of the embedding space. The system then iteratively refines the candidate space using geometric constraints on the embedding space determined in response to relative feedback by the user. At each iteration the system identifies to the user a subset of documents from the then-current candidate space, based on which the user provides the relative feedback. In an embodiment, these subsets of documents are more discriminative than the average discriminativeness of similar sets of documents in the then-current candidate space.

Abstract: An operator graph is established for processing elements configured to perform operations on tuples of streaming data. A first processing element in the operator graph includes a barrier operator that joins output of upstream operators. It is determined that at least one timeout condition has occurred at the barrier operator and substitute data tuple values are generated for missing tuple output data from at least one of the upstream operators. A first barrier tuple output is generated by joining the substitute data tuple values with received data tuple values from the upstream operators. A copy of the received data tuple values is stored. It is determined that a set of one or more tuples received at the barrier operator includes the missing tuple output data. A second barrier tuple output is generated by joining the missing tuple output data values with the copy of the received data tuple values.

Abstract: In an approach to cooperative evidence gathering, a first computing device receives a request for data corresponding to an event, where a second computing device detecting the event initiates the request for data. The first computing device aggregates data from one or more sensors, the one or more sensors associated with one or more first computing devices within a proximity of a location of the event. The first computing device determines whether at least a portion of the aggregated data is applicable to the event.

Abstract: An approach to generating irreducible modules. The approach includes a method that includes receiving, by at least one computing device, data associated with a specification. The method includes defining, by the at least one computing device, a pattern on the received data. The pattern reduces a set of rules into a single condition. The method includes generating, by the at least one computing device, an irreducible module based on the pattern. The irreducible module has one output dependent variable and is associated with a data flow application.

Abstract: Systems and methods to store, in a database, product information identifying each respective product in the database, a store in the shopping mall that carries the respective product, and a location within the store where the respective product is physically accessible by a customer visiting the mall. The database is updated via communicating with database systems of stores in the mall and/or dispatching robots to the stores to collect data for the updates. Frequencies of the updates are determined based on sales volumes of the stores. A server is used to provide a user interface to access the database of the mall and provide navigational guidance for travel from current locations of user devices and the locations of the items.

Abstract: A method and system for capturing relational data, objectively ordering search results, and displaying search results are disclosed herein. The method includes using a computing device, including at least one processor and memory, for receiving content comprising one of scientific, academic, and research-oriented data from a content source. The method also includes determining one or more measured variables related to the one of scientific, academic, and research-oriented data of the content. The method also includes determining one or more relationships between the received content and previously received content based on the determined one or more measured variables. Further, the method includes communicating the one or more relationships to one or more relational databases configured to index the one or more relationships.

Abstract: A system includes at least one processor and processes an ETL job. The system analyzes a specification of the ETL job including one or more functional expressions to load data from one or more source data stores, process the data in memory, and store the processed data to one or more target data stores. One or more data flows are produced from the specification based on the one or more functional expressions. The one or more data flows utilize in-memory distributed data sets generated to accommodate parallel processing for loading and processing the data. The one or more data flows are optimized to assign operations to be performed on the one or more source data stores. The optimized data flows are executed to load the data to the one or more target data stores in accordance with the specification. Present invention embodiments further include methods and computer program products.

Abstract: A method of managing on-line user data in a table-level distributed database system is disclosed. At a loading interface, a load request from a client device specifying a new or updated data table, which has been populated in a distributed file system, is received. The load request also specifies a location in the distributed file system and a schema of the data table. The loading interface creates new records in a metadata store, and each new record specifies a mapping between the data table and a particular instance that is to load such data table. Each record also specifies the location and schema for such data table. Based on the new records, each instance also loads the data table. Each instance publishes, in the metadata store, load status specifying that loading of the data table is complete so that such data table can be queried by a query client.

Abstract: A system includes at least one processor and processes an ETL job. The system analyzes a specification of the ETL job including one or more functional expressions to load data from one or more source data stores, process the data in memory, and store the processed data to one or more target data stores. One or more data flows are produced from the specification based on the one or more functional expressions. The one or more data flows utilize in-memory distributed data sets generated to accommodate parallel processing for loading and processing the data. The one or more data flows are optimized to assign operations to be performed on the one or more source data stores. The optimized data flows are executed to load the data to the one or more target data stores in accordance with the specification. Present invention embodiments further include methods and computer program products.

Abstract: A method for testing an extract, transform, load job (ETL job) is provided. The method may include receiving an uploaded ETL job. The method may also include executing a functionality test of the uploaded ETL job using a test bucket. The method may further include determining the executed functionality test produces a failure result. The method may also include creating at least one test sub-job corresponding to at least one stage within on the uploaded ETL job. The method may further include generating a plurality of test data for each of the at least one created test sub-job. The method may also include executing the at least one created test sub-job using the plurality of generated test data. The method may further include creating a report based on a plurality of results associated with the at least one executed test sub-job.

Abstract: A system for transforming time series data into data that is accessible by a data warehouse identifies a data table comprising the time series data. The system creates a virtual view of the data table where the time series data is represented as at least one standard relational table in the virtual view, where the virtual view is presented as a virtual table. The system partitions the virtual table into a plurality of virtual partitions according to a time interval. The virtual table is partitioned across a data time range, where the data time range comprises at least one time interval, and where each of the plurality of virtual partitions has a respective partition time range that spans the time interval. The virtual partitions are created to optimize loading of the data into the data warehouse by incrementally refreshing the data according to the respective partition time range.

Abstract: Unit conversion of data in a database is performed, so that efficient use of data can be achieved. VL and VNo in an index associated with each field of a table, define correspondence between a record number and a field value. In the n-th entry of VNo, a rank of the entry in VL is registered where the field value associated with the record having n-th record number in the table is registered. When the system of units of the value registered in VL is not a predetermined system of unit, VLC is provided, so as to apply unit conversion to the value in each entry of VL and to register the converted value in the entry on the same rank in VLC. Then, instead of VL, VCL and VNo define the correspondence between the record number and the field value.

Abstract: Entity resolution in a database comprises receiving imported data comprising imported data entities each having properties each having values; receiving first user input that selects the imported data entities for resolution to existing data entities in a database; receiving second user input that specifies matching criteria for matching the imported data entities to the existing data entities, wherein each of the matching criteria comprises a matching technique; matching the imported data entities to the existing data entities using the matching criteria, resulting in creating and storing matched entity information, wherein the matched entity information is organized in matched entity data sets associated with subsets of the matching criteria that were matched; consolidating the imported data entities into the existing data entities; storing the first user input and second user input as a named criteria set for use in subsequent entity resolution operations.