Abstract: A system and method for generating a second file in a target using a first file and a difference file is provided. The system also provides for a method of transferring a difference file from a source device to the target device in a two or more partial blocks which may be transferred independently and which do not all need to be stored in the target device at any given time. The partial blocks of the subject system each include a plurality of segments, which may each function as a difference instruction to instruct the target device to generate a corresponding portion of the second file. Each of these segments may include a reference to source data within the first data or a reference to new plain data that is provided within the partial block. In this way, the second file may be accurately constructed while minimizing the data transferred.

Abstract: Storage virtualization techniques allow directories to be stored remotely, for example, by a cloud storage provider, but in a manner that appears to a user or application running on a local computing device as if the directories are stored locally—even though the data of those directories may not be resident on the local computing device. That is, the contents of directories that may exist in the cloud look and behave as if they were stored locally on a computing device.

Abstract: A method includes scanning, by a scanning module, from plurality of sets of encoded data slices to plurality of sets of encoded data slices, to identify encoded data slices that are in need of rebuilding. The method further includes adding, by the scanning module, the identified encoded data slices into a first level rebuilding queue. The method further includes analyzing, by an analyzing module, the identified encoded data slices based on a rebuilding prioritization function to establish a prioritization for the identified encoded data slices. The method further includes transferring, by the analyzing module, a first group of encoded data slices into a first priority rebuilding queue and a second group of encoded data slices into a second priority rebuilding queue based on the analyzing. The method further includes rebuilding, by a rebuilding module, the first and second group of encoded data slices based on a rebuilding prioritization protocol.

Abstract: Systems and methods are disclosed for early access to captured images including receiving a request for at least one image of a geographic area from a client application of an operator user device; querying records within a geospatial database to locate one or more records of images accessible by the geospatial database and depicting at least a portion of the geographic area; reading information within the one or more records depicting at least a portion of the geographic area to determine a status of an image within the one or more records, the status of the image indicating that the image is an in process captured image in which the image has not been fully processed; and presenting at least a portion of the image to the client application of the operator user device with a status indicator indicating the stage in processing of the geographic area.

Abstract: A system and method for managing geotag data associated with content within a geofeed is provided. The content may be tagged with metadata such as geotag data that may specify a location where the content was created. The generated content may be geotagged by one or more geotag sources including a GPS-enabled device, a user input, a content provider, a user profile, or other sources. The system may determine the geotag data for the content that is not already associated with geotag data. The system may determine a confidence level of the geotag data, whether already geotagged or not. The confidence level may be indicative of a likelihood that the geotag data accurately describes a location where the content was actually created.

Abstract: Access to a set of media content items is acquirable. Identified processors can perform, in parallel, object detection for the set. In some cases, information about a current system state, a user, and/or object popularity metrics is acquirable for selecting a subset of object models. Object recognition is performable, based on the subset, for the set of media content items. In some instances, a camera view can be provided. Object recognition is performable for representations of the view. An object depicted in the representations is identifiable. An interface portion is presentable to provide a label for the object. In some cases, object recognition is performable for the set of media content items to identify an object depicted in a content item. A label is associable with the content item. A search through the set of media content items can identify, based on the label, a subset that depicts the object.

Abstract: Access to a set of media content items is acquirable. Identified processors can perform, in parallel, object detection for the set. In some cases, information about a current system state, a user, and/or object popularity metrics is acquirable for selecting a subset of object models. Object recognition is performable, based on the subset, for the set of media content items. In some instances, a camera view can be provided. Object recognition is performable for representations of the view. An object depicted in the representations is identifiable. An interface portion is presentable to provide a label for the object. In some cases, object recognition is performable for the set of media content items to identify an object depicted in a content item. A label is associable with the content item. A search through the set of media content items can identify, based on the label, a subset that depicts the object.

Abstract: An image search device searching an image from an image database storing a recorded image, one or more types of feature values, and propagation information that indicates a link between a same type of the feature values of the recorded image, the device acquires a first image and the one or more types of feature values of the first image, records the first image and the feature values in the image database, calculates a propagation intensity indicating similarity or sameness between the types of feature values of the recorded image and the types of feature values of the first image, and includes in the propagation information a link between the types of feature values of the first image and the types of feature values of the recorded image for which the propagation intensity between the types of feature values of the recorded image and the types of feature values of the first image is at a maximum value.

Abstract: According to one embodiment, in response to a content description describing a content item, an analysis is performed on the content description. An image having image content is identified that is related to the content description based on the analysis. One or more phrases are derived from the content description based on the analysis, the one or more phrases summarizing the content description. A list of content styles is determined based on a relationship between the image and the one or more phrases. A composite content item having the image and the one or more phrases therein is generated based on a selected content style selected from the list of content styles. The image and the one or more phrases are arranged according to a layout corresponding to the selected content style.

Abstract: According to one embodiment, a content item is received that was searched and identified based on a first set of one or more keywords determined based on a search query received from a client device over a network. A search is performed in an image store to identify a plurality of images based on the first set of keywords and a second set of one or more keywords associated with the content item. The images are ranked based on a user context obtained at a time when the search query was received. A composite content item is generated by incorporating an image selected from the ranked images with the content item, where the selected image is ranked above a predetermined threshold. The composite content item is transmitted to the client device over the network.

Abstract: According to one embodiment, a content item is received that was identified in response to a search query received from a client. It is determined whether the search query is within a predetermined percentage of total search queries that yield the content item. In response to determining that the search query is within the predetermined percentage of the total search queries, a search is performed in an image store based on one or more keywords associated with the search query to identify a list of one or more images and one of the identified images is selected to be matched with the content item. Otherwise, a predetermined preferred image is selected to be matched with the content item. The content item is incorporated with the selected image to generate a composite content item to be transmitted to the client.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for query categorization based on image results. In one aspect, a method includes receiving images from image results responsive to a query, wherein each of the images is associated with an order in the image results and respective user behavior data for the image as a search result for the first query, and associating one or more of the first images with a plurality of annotations based on analysis of the selected first images' content.

Abstract: The current document is directed to efficient, distributed-search methods and subsystems within distributed computer systems, including computer systems distributed over multiple sets of geographically distributed data centers, each comprising multiple discrete computer systems, such as multi-processor servers. In one implementation, the distributed-search methods and subsystems are implemented locally within participating entities as well as within one or more distributed-search engines. Each search is directed, by a participant, to identify attribute-associated entities within, provided by, connected to, or otherwise accessible to a distributed computing system having attribute values specified or indicated by the search query. Certain attribute values are continuously collected and centrally stored by the one or more centralized distributed-search engines while other attribute values are obtained through information requests distributed among participating entities.

Abstract: Upon receiving a query at a local database server from a client directed to a LOB stored at a remote database server, a remote LOB locator is created comprising a local LOB locator indicating the LOB's location and a database link associated with the remote database server. The remote LOB locator is communicated to the client, which submits a request to the local database server to perform an operation directed to the LOB. The request is forwarded to the remote database server using the remote LOB locator, where the operation is performed. This mechanism is extended to work with sharded databases. Character set conversions are minimized when returning data to the client from the remote database server. Remote LOB locators may serve as bind variables for DML statements directed to local or remote tables. Local LOB locators may serve as bind variables for DML statements directed to remote tables.

Abstract: Some external users in a public on-line community may post excessive numbers of items, causing annoyance to others and unnecessary loading on database resources. A robust moderation framework enables an individual community moderator or admin to specify a set of rules and actions to mitigate this problem. Scalable, performant rate limiting rules employ windowed counters, separately for each rule, with the counters maintained in cache memory resources outside the main database.

Abstract: Provided are a system and method for generating a database scheme for storing different types of data structures. In one example, the method includes receiving a first data object having a first data structure and a second data object having a second data structure that is different than the first data structure, generating a database scheme based on the first data structure and the second data structure, wherein the generated database scheme retains information about a structure of the first data structure and a structure of the second data structure, and storing the first data object and the second data object, in a database, according to the generated database scheme. According to various aspects, by at least partially retaining the original structure of the data objects, further searching and processing may be performed on different types of data objects stored in a relational database.

Abstract: Systems, computer program products and methods implementing access control for compound structures including subfields are described. A policy system receives a database schema and a data access policy. The database schema defines multiple subfields of a data column. The policy includes one or more rules limiting access to the subfields. A policy analyzer of the policy system creates an access control metadata that stores correspondence between the subfields and the rules. The policy analyzer represents the subfields in the access control metadata using relations between subfields and other components of the database. The policy analyzer provides the access control metadata to a policy enforcer for enforcing the policy on the subfields.

Abstract: Various examples are directed to exposing database artifacts. For example, a rules engine may receive schema data describing a database schema of an in-memory database. The schema data may describe a table, a view, and a procedure. The rules engine may generate a data model comprising a plurality of translation artifacts including a table translation artifact describing a table of the database schema, a view translation artifact describing a view of the database schema, and a procedure translation artifact describing a procedure of the database schema. A mapping service may receive from a client application a first client request comprising first metadata describing the view translation artifact. The mapping service may initiate execution of the view at an in-memory database to determine a view result; and send the view result to the client application.

Abstract: A controller of a data storage system generates fingerprints of data blocks written to the data storage system. The controller maintains, in a data structure, respective state information for each of a plurality of data blocks. The state information for each data block can be independently set to indicate any of a plurality of states, including at least one deduplication state and at least one non-deduplication state. At allocation of a data block, the controller initializes the state information for the data block to a non-deduplication state and, thereafter, in response to detection of a write of duplicate of the data block to the data storage system, transitions the state information for the data block to a deduplication state. The controller selectively performs data deduplication for data blocks written to the data storage system based on the state information in the data structure and by reference to the fingerprints.

Abstract: Methods and devices for creating enhanced data records from multiple disparate contract data sources may include accessing a plurality of data feeds from a plurality of websites to obtain a plurality of disparate sets of contract data relating to contract opportunities. The methods and devices may include generating according to an enhancement procedure, enhanced normalized contract data for each contract opportunity from the plurality of disparate sets of contract data, wherein the enhanced normalized contract data includes a normalized set of fields to present information relating to each contract opportunity. The methods and devices may include transmitting the enhanced normalized contract data for presentation on an interface of at least one device.

Abstract: Elements of a database object are removed. The database object is stored as a plurality of different object portions, where each object portion is associated with one or more versions of transaction identifiers stored separately from the database object. An oldest transaction identifier is determined for a transaction for which data portions of the database object remains visible. Each object portion is examined and object portions with a threshold amount of data to remove are determined based on a comparison of the transaction identifiers for those object portions and the oldest transaction identifier. Data from the database object are removed in response to a sufficient quantity of data is to be removed from object portions containing the threshold amount of data.

Abstract: A computer-implemented method includes detecting an update to a record in an entity table of a database. At least one of an age score, a lineage score, and a completeness score for the record is calculated, responsive to the update. A trust factor is calculated, by a computer processor, based on the at least one of the age score, the lineage score, and the completeness score for the record. The trust factor indicates a level of trustworthiness of the record. It is decided whether to use data in the record based on the trust factor.

Abstract: Disclosed are examples of systems, apparatus, methods, and computer program products for accessing and displaying shared data. In some implementations, a shared cache can be maintained. A first component and a second component can be identified. A shared record can be identified as associated with the first component and the second component. It can be determined that the shared record is valid. Shared record data from the shared record can be displayed through the first component and the second component in a user interface.

Abstract: The present invention relates to a system and method for supporting contact reminding and includes: a contact history database for storing information on a contact history; an unregistered contact point obtaining unit for obtaining an unregistered contact point which has not been registered with an address database, based on the contact history stored in the contact history database; and a contact point recommending unit for calculating contact statistics for a preset certain period by using the contact histories of the obtained unregistered contact points, determining, as a recommended contact point, an unregistered contact point from which contact has not been received recently, based on the calculated contact statistics of the unregistered contact points and the number of times that contact has been made for a recent certain period, and informing a user of the determined recommended contact point.

Abstract: In one respect, there is provided a distributed database system. The distributed database system can include a plurality of nodes and a plurality of optimizers. A first optimizer of the plurality of optimizers can be configured to: receive, from a client, a command; generate, based at least in part on global metadata cached by the first optimizer, an execution plan for fulfilling the command that includes one or more tasks to be performed by at least a first node of the plurality of nodes; determine that at least one task of the one or more tasks are not successfully performed by the first node; and in response to determining that at least one task of the one or more tasks are not successfully performed by the first node, updating the cached global metadata at the first optimizer.

Abstract: Various embodiments of systems and methods for optimizing in-memory column based database table compression. A system may receive a parsed in-memory columnar database table as an input and reads an aggregated compression score from memory corresponding to the parsed database table. A total compression score may be computed iteratively for the database table in order to determine whether the total compression score is greater than the aggregated compression score. When the total compression score determined to be greater than the aggregated compression score, the aggregated compression score is assigned to a best compression score. To optimize in-memory database table compression, the given database table may be compressed using the best compression score.

Abstract: Machine-generated data is divided into its metadata (or contextual data) that is indicative of a data container, and the data values themselves that are indicative of sensed variables. The metadata is checked to obtain a container integrity indicator of whether the data is accurate based on characteristics of the data container. The actual data values are subjected to quality checking to determine whether they have been corrupted by inaccuracies. Data corresponding to inaccurate metadata or inaccurate data values themselves is quarantined, and correction logic attempts to correct any inaccurate data. Corrected data is output with the verified data.

Abstract: An online system uses a task async engine to coordinate task execution, such as for phased content creation, where the system enables content providers to efficiently create and publish sponsored content in multiple phases. Each phase of the content creation is represented by a draft of the content. Multiple drafts of the content are stored in a repository of the online system for optimizing content delivery and publication, such as quick identification of conflicts in a draft based on analysis of draft fragments of the draft. Objects associated with the sponsored content are stored in an object model. The connections amongst the various draft segments of a draft are stored in a hierarchy structure. Each user associated with a draft has a role, where all of the roles can contribute to the draft. The online system efficiently publishes the drafts and presents the sponsored content to its target users.

Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.

Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.

Abstract: An automated correlation and deduplication of identities process enables a single identity to be utilized across the enterprise for a user. During a user enrollment process, a requesting system captures user attributes. The requesting system sends a message with a portion of the attributes across a message bus that other identity providers receive. The other identity providers provide a listing of potential matches that are processed by a correlation engine that analyzes variables to predict the likelihood of a potential match being the particular user. If the likelihood reaches a predetermined threshold, the corresponding potential match is correlated to the particular user through a mapped linkage and recorded in an identity repository. If the likelihood does not reach a predetermined threshold, the corresponding potential match is dismissed as not being sufficiently likely that a correlation exists or resubmitted through the process as needing additional clarifying details.

Abstract: Aspects described herein are concerned with automatically validating spatial features of a spatial dataset. One solution is built upon a database server which performs a decomposition of the features' geometries into line segments, after which, sets of line segments are compared to detect errors in the dataset. The decomposition of features geometries into line segments results in a reduction of processing time with a simultaneous increase of precision. The method not only generates new intermediate database structures for detection of topological errors but is also complemented by a clearance process that can lead to the automatic repair of topological errors. The clearance process identifies topological errors and provides modifications to the previously identified line segments such that a modified set of line segments overcomes the conditions that led to the error state. The changes to the data set can be applied automatically after displaying them as an overlay for a predefined amount of time.

Abstract: Examples of methods, systems, and computer-readable media for completing, updating, and maintaining structured or unstructured datasets, including data stored in a structured relational database, unstructured database or line of business system such as a directory service, a Customer Relationship Management database, or other structured or unstructured data source. In some examples, administrators specify a dataset to be maintained and definitions for the data of the dataset to follow. A computer system programmed for maintaining datasets analyzes the dataset and applies the specified definitions. If there is data that does not conform, that data is flagged for attention. The computer system then searches internal and external data sources to find examples of correct data to provide suggestions to users. The computer system then contacts a user through a communication channel to start an automated dialog with the user.

Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.

Abstract: A system and method for managing tables in a storage system is described.

Abstract: There are provided methods and systems for providing viewers of a digital image with information about identifiable and scenes within the image. In an embodiment, digital images, uploaded to a host website, are customized through the incorporation of some number of selectable informational links and other text based information to provide viewers of the image real-time access to social and advertising related information regarding certain identifiable objects and scenes in the image. The selectable information links are incorporated within and around the digital image in a process referred to herein as image tagging.

Abstract: Methods for querying a database and database systems include optimizing a database query for parallel execution using spatial and temporal information relating to elements in the database, the optimized database query being split into sub-queries with sub-queries being divided spatially according to host and temporally according to time window. The sub-queries are executed in parallel. The results of the database query are outputted progressively.

Abstract: The present disclosure relates to a computer-implemented method, computer program product, and computer system, for optimization of query processing a set of data extents on which a table is stored. Attribute value information may be maintained for each data extent. The attribute value information indicate as ranges the minimum and maximum values of an attribute of the entries stored in the respective extent. A first metric of a first data extent of the set may determine splitting the first data extent into sub-extents increases query processing efficiency. A second metric of a second data extent and a third data extent may determine merging the second data extent and the third data extent increases query processing efficiency.

Abstract: In an example embodiment, one or more query terms are obtained. For each of the one or more query terms, a standardized entity taxonomy is searched to locate a standardized entity that most closely matches the query term. A confidence score is calculated for the query term-standardized entity pair for the standardized entity that most closely matches the query term. In response to a determination that the confidence score transgresses a threshold, the query term is associated with an entity identification corresponding to the standardized entity that most closely matches the query term. One or more query rewriting rules corresponding to an entity type of the standardized entity having the entity identification are obtained. The one or more query rewriting rules are executed to rewrite the first query such that the rewritten query, when performed on a data source, returns fewer search results than the first query would have.

Abstract: A reduced version of a search query can be pre-applied to limit the search scope. A query processor can maintain one or more metadata structures for a structured data store where each metadata structure is based on a single field of documents that are stored in the structured data store. When a search query is received, the query processor can generate a reduced version of the search query to be run against one of the metadata structures. The results of running the reduced version of the search query will identify which of the portions of the structured data store the full search query should be run against. In this way, the query processor can avoid loading and evaluating the search query against all portions of the structured data store.

Abstract: A system includes reception of a database query, determination of a first logical query execution plan to execute the database query over a plurality of heterogeneous execution engines, selection of a first logical operator of a first operation level of the first logical query execution plan, identification of a first one or more physical operators corresponding to the first logical operator and an output format of each of the first one or more physical operators, each of the first one or more physical operators provided by a respective one of the plurality of heterogeneous distributed execution engines, selection of a second logical operator of a second operation level of the first logical query execution plan, the second logical operator to receive output from the first logical operator, identification of a second one or more physical operators corresponding to the second logical operator, each of the second one or more physical operators provided by a respective one of the plurality of heterogeneous execut

Abstract: A computer-implemented method of generating faster and more efficient database query execution plans includes receiving a database query, generating an optimized query execution plan, and initiating execution of the optimized plan. Database can include table columns with associated column dictionaries. Database query can have statements with conditions. Generating the optimized query execution plan involves comparing contents of a column dictionary semantics of the statements, omitting statements which will always be TRUE and omitting conditions which will always be FALSE. Related apparatus, systems, techniques, methods and articles are also described.

Abstract: A pattern matching component is provided. The pattern matching component utilizes a plurality of processors to efficiently identify and retrieve information from a plurality of data sources. In some examples, the pattern matching component concurrently executes multiple portions of a data access plan, such as a query execution plan, using a plurality of processors disposed within a multi-core processor. The pattern matching component may concurrently execute multiple portions of the data access plan using a plurality of processors in a distributed system. Concurrent execution of at least some of the operations required to identify and retrieve the information results in increased efficiency over conventional query execution methods.

Abstract: A batch data query method and apparatus are provided. A data query server determines symbol identifiers of operands in N query statements according to operators and the operands in the N query statements, where the symbol identifiers include version numbers of the operands; determines dependency among the N query statements according to the version numbers of the operands in the N query statements; and then, performs inter-query optimization on the N query statements according to the dependency among the N query statements and a preset optimization rule.

Abstract: Queries may be received and executed by a managed query service. A query directed to data sets that are separately stored in a remote data store may be received. Computing resources to execute the query may be provisioned from a pool of computing resources that are configured to execute queries. The query may be routed to the provisioned computing resources to execute the query. Results may be obtained from the computing resource and provided to a submitter of the query.

Abstract: The configuration of computing resources for executing queries may be selected. A comparison of the configuration of computing resources that executed previous queries may be made to select the configuration of computing resources for a received query. A historical query execution model maybe applied, in some embodiments, to determine a resource configuration for computing resources to execute a query. The computing resources may be selected from available computing resources according to the determined resource configuration.

Abstract: Interruptible computing resources for executing queries may be selected. When queries are received, the probability that query can complete execution at interruptible computing resources may be determined. Computing resources to process the query may be selected based on the probability. For queries that are performed on computing resources that are interrupted, interruption handling techniques may retry the query on other computing resources or complete the query on other computing resources, in some embodiments.

Abstract: A method includes parsing a regular pathway expression into fragments including an anchored fragment and at least one other fragment. A number of the fragments is based on at least a length limitation of the regular pathway expression. The method includes generating an operator directed acyclic graph (DAG) including non-operator nodes, operator nodes, and a root based on at least the anchored fragment. The method includes removing, from the operator DAG, at least one of the non-operator nodes and connecting a first operator node to a second operator node of the operator nodes. The first operator node includes an edge into the at least one removed non-operator node, and the second operator node includes an edge from the at least one removed node. The method includes executing the operator DAG on a graph database to return a pathway set comprising at least one pathway that satisfies the regular pathway expression.

Abstract: Management of a virtual infrastructure via an object query language module is described. The virtual infrastructure includes one or more virtual machines, and one or more host machines communicatively coupled with the one or more virtual machines. The virtual infrastructure also includes a centralized management tool communicatively coupled with the one or more host machines. The object query language module fetches information from the one or more host machines and the one or more virtual machines. It further provides commands to the one or more host machines and the one or more virtual machines. In response to the fetch and command of the one or more host machines and the one or more virtual machines, a result of the fetch and command is displayed via a graphical user-interface.

Abstract: A method for stratified-sampling-based query execution includes: receiving a query; collecting a first data sample from the first dataset using a non-stratified sampling technique; performing statistical analysis on the first data sample; identifying a stratum classifier from the statistical analysis; generating a stratum classification by calculating strata boundaries for the stratum classifier; and calculating a result to the query based on analysis of the second data sample.