Abstract: A method performed by one or more processors includes retrieving a set of images; selecting, based on the images retrieved, a reference template; calculating optimal transportation plans between the reference template and each of the images in the set; and calculating, using the optimal transportation plans, a linear optimal transportation metric between at least two images in the set.

Abstract: Implementations generally relate to providing photo heat maps. In some implementations, a method includes collecting photos associated with at least one object, where the photos are collected from a plurality of users. The method further includes determining heat map information associated with the photos. The method further includes generating a heat map based on the heat map information, where the heat map indicates a quantity associated with the at least one object and associated with one or more geographic regions.

Abstract: According to an example aspect of the present invention, there is provided an apparatus comprising at least one receiver configured to receive sensor information, at least one processing core configured to determine, based at least in part on the sensor information, a position of a device on a physical surface and to obtain or cause obtaining of an image relating to the determined position wherein obtaining the image comprises obtaining static content based on the position of the device on the physical surface and obtaining dynamic content based a virtual space associated with the physical surface.

Abstract: Methods, systems and apparatus for refining image annotations. In one aspect, a method includes receiving, for each image in a set of images, a corresponding set of labels determined to be indicative of subject matter of the image. For each label, one or more confidence values are determined. Each confidence value is a measure of confidence that the label accurately describes the subject matter of a threshold number of respective images to which it corresponds. Labels for which each of the one or more confidence values meets a respective confidence threshold are identified as high confidence labels. For each image in the set of images, labels in its corresponding set of labels that are high confidence labels are identified. Images having a corresponding set of labels that include at least a respective threshold number of high confidence labels are identified as high confidence images.

Abstract: An image processing apparatus that processes light field information indicating the intensity distribution of light and incident directions of light, and a method for controlling the same are disclosed. A derivative information analyzing unit 113 analyzes a derivative information that is generated by a derivative information generating unit 112 from light field information, and obtains information representing features of the derivative information. An additional information editing unit 114 generates additional information to be attached to a derivative information, based on the information representing features of the derivative information.

Abstract: To reduce communication costs and computational complexity, only a subset of ranked SIFT points within a query image for a visual search request is transmitted to the visual search server in each iteration of an incremental search. For each candidate match, a flag identifying the matching points is returned by the server for use in computing holistic (e.g., histogram) information for a bounding box within the query image including the matching points. Distance from that query image holistic information is used to reject images from a short list used for a subsequent iteration, if any. If all images are rejected or a match criteria is met during one iteration, the search may terminate early without consideration of remaining SIFT points.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for previewing search results. In one aspect, a method includes receiving a query from a client device. One or more image search results are provided to the client device, each of the one or more image search results identifying a corresponding image resource and each of the one or more image search results including an image representation of the corresponding image resource. One or more related queries are provided to the client device, the one or more related queries having been determined to be related to the query, wherein each of the one or more related queries includes a preview image to be displayed at the client device, the preview image representing an image search result responsive to the related query.

Abstract: A method is used in applying XAM processes. A set of content is received via any of a file system interface, a block based interface, an object based interface to an object addressable data storage system. An object derived from the set of content and having an object identifier is stored in the object addressable data storage system. The object is made available for retrieval via the object based interface using the object identifier.

Abstract: Systems and methods for providing an enterprise level view of an organization's data including an SOA business process server, an enterprise meta model and an enterprise database. The SOA business process server and enterprise meta model are synchronized by automated tools so that a change to one of these components will be reflected in the other. The enterprise database is populated by data automatically extracted from a process engine of the business process server. The enterprise database is populated in real time so that enterprise level views based on the enterprise database will be accurate in real time.

Abstract: In one embodiment, a distributed database system supporting flexible configuration of data clusters is disclosed. The system includes a cluster manager, an index, and a dataset distributed over one or more database clusters. Where the nodes of the clusters may report ownership of a particular range, the index contains an alternate range. The cluster manager receives requests to access a range of data within database and queries the index to determine the appropriate nodes and/or clusters with which to connect. The cluster manager then directs the requestor to connect to the specified nodes and/or clusters.

Abstract: One or more trust characteristics are obtained. The one or more trust characteristics are attributable to a storage infrastructure from which one or more data sets stored in one or more data repositories are obtained. The one or more trust characteristics attributable to the storage infrastructure are associated with the one or more data sets such that the one or more data sets are characterized as having a trustworthiness reflective of the one or more trust characteristics. The one or more trust characteristics and the association with the one or more data sets are stored as metadata in the one or more data repositories.

Abstract: This disclosure relates to database systems and, more particularly, to database systems with version controlled data. A version controlled database program resides on a computer readable medium, having a plurality of instructions stored thereon, which, when executed by a processor, cause the processor to perform operations. The operations include defining a version object software layer. The version object software layer may be configured to read and write data of a version controlled database to a physical storage medium, maintain one or more versions of at least one element of the data, and provide access to the data. The operations may also include defining a database management software layer. The database management software layer may be configured to read and write data to the version object software layer and provide a database access interface for accessing the data.

Abstract: The technique described herein provides a way to summarize data and can also minimize unnecessary accesses to a data store. In one embodiment, the technique creates and stores an adaptive range filter that contains a compact summary of the contents of an index for a data store in the form of a trie data structure. Before accessing the index of the data store in response to a query, the technique checks the filter to determine whether the data store does not contain any keys for a specific range of data. If the adaptive range filter indicates that the index contains no keys satisfying the query predicate, the index of the data store and the data itself is not accessed. The adaptive range filter of the technique supports both range predicates and equality predicates. It is adaptive to changes in data and queries by learning the query and data distribution.

Abstract: A map searching system determines locations responsive to a search query. The map searching system parses the search query to generate a set of search tokens and searches a plurality of location category indices using the search tokens. The location category indicies specify indexes of locations according to various location categories, such as points of interest and cross streets. The resulting records selected from the search tokens are scored based on scoring weights specific to the location category index that a record was selected from. After scoring, a number of high-scoring records are selected as the responsive records to the location search.

Abstract: A method for generating a scalable visualization of a hierarchical data structure is provided. The method may include mapping at least one component within a plurality of components to the hierarchical data structure. The method may also include mapping at least one sub-component within a plurality of sub-components to the at least one mapped component. The method may further include mapping at least one variant within a plurality of variants to the hierarchical data structure as an accordion user interface widget. Additionally, the method may include mapping at least one variant component within a plurality of variant components to the at least one mapped variant as an accordion user interface widget. The method may also include mapping at least one variant sub-component within a plurality of variant sub-components to the at least one mapped variant component as an accordion user interface widget.

Abstract: Provided are methods, systems, and computer readable media for user interaction with database methods and systems. In an aspect, a user interface can be generated to permit dynamic display generation to view data. The system can comprise a visualization component to dynamically generate one or more visual representations of the data to present in the state space.

Abstract: In accordance with disclosed embodiments, there are provided methods, systems, and apparatuses for fixing logical or physical corruption in databases using LSM trees including, for example, means for storing records in a LSM database at the host organization; processing transactions to the LSM database by writing the transactions into immutable extents for subsequent merge into the LSM database; recording a history of the transactions in a log; identifying corruption in at least one of the records of the LSM database represented within the immutable extents prior to use of the immutable extents in the LSM database; and correcting the identified corruption to the at least one of the records of the LSM database based at least in part on the recorded history of the transactions in the log during live operation of the LSM database. Other related embodiments are disclosed.

Abstract: According to an aspect, a method for correcting an invalid script in a web application includes determining an invalid reference in an invalid script. A storage location is determined in a database corresponding to the invalid reference based on a data relationship mapping, wherein the data relationship mapping indicates the correspondence between the reference and a storage location in the database. An up-to-date value at the storage location is queried and the queried up-to-date value is determined to be the correct value of the invalid reference.

Abstract: A data consistency management system may include a memory storing machine readable instructions to receive a query, and determine a suitability of the query for processing by a NoSQL data store, or a RDBMS. The memory may further include machine readable instructions to rank data tables based on a combination of read queries and query patterns suitable for the NoSQL data store. Based on the ranking, the memory may further include machine readable instructions to determine data tables that are to be managed by the NoSQL data store, or by the RDBMS, determine whether the query is for a data table managed by the NoSQL data store, and based on a determination that the query is for a data table managed by the NoSQL data store, translate the query to NoSQL API calls for using the NoSQL data store to respond to the query.

Abstract: Validating a write of a replica record to a replica data store in a transaction processing system. The source record is written to a location in the source data store, and the location is recorded in a transaction log file. The transaction processing system obtains from the transaction log file the location, and the location in the replica data store to which the replica record will be written is predicted, based on the location and length of the previous replica record. If the obtained location of the source record corresponds to the predicted location of the replica record location, the replica record is written to a location in the replica data store.

Abstract: New data messages for updating a database can indicate a latency tolerance. The latency tolerance can constrain new data records based on such new data messages to also indicate the latency tolerance. Latency-tolerant data records can be constrained to remain in the working database for a minimum duration. Data records present in the working database can be prioritized according to prioritization criteria that increases priority of data records indicating latency tolerance. Matching incoming data messages with the data records present in the working database can be based on such prioritization. A matched data record can be updated or deleted upon successful match with an incoming data message. The latency tolerance can be applied to trading systems for financial instruments or interests as a long-life order that rests in an order book without being able to be cancelled or updated for the minimum duration in exchange for priority during order matching.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.

Abstract: A computer implemented method for generating code for an integrated data system. A mixed data flow is received. The mixed data flow contains mixed data flow operators, which are associated with multiple runtime environments. A graph is generated containing logical operators based on the mixed data flow in response to receiving the mixed data flow. The logical operators are independent of the plurality of runtime environments. The graph is converted to a model. The logical operators are converted to model operators associated with the multiple runtime environments. The model operators allow for analysis of operations for the mixed data flow. The model is converted into an execution plan graph. The execution plan graph is executable on different runtime environments.

Abstract: Methods, systems, and apparatus, including computer program products, for identifying the language of a search query. In one embodiment, the language of each term of a query is determined from the query terms and the language of the user interface a user used to enter the query. In another embodiment, an automatic interface language classifier is generated from a collection of past queries each submitted by a user. In some embodiments, a score is determined for each of multiple languages, each score indicating a likelihood that the query language is the corresponding one of the multiple languages.

Abstract: Techniques are described for performing filter and project operations. In an embodiment, a set of predicates that specify criteria for filtering results to a query is received. Based on a particular predicate of the set of predicates, a predicate result for at least one portion of a particular column is generated. The predicate result identifies rows within the first column that satisfy the particular predicate. Rows are selected and returned as results to the query based at least in part on the predicate result. In an embodiment, the predicate result is a bitvector where each bit of the bitvector corresponds to a particular row within the particular column and identify whether the particular row satisfies the particular predicate.

Abstract: Various embodiments include systems and methods for generating query rewrite records which may be used to generate standardized query rewrites for a search engine. Such records may identify rewrite triggers as well as constraints and other metadata flags which may be associated with certain rewrites in query rewrite identification (QRIL) records. In certain embodiments, such records may be analyzed with other QRIL records or rewrite information to prevent rewrite conflicts and to generate standardized rewrites. This information may then be used by a search engine to generate responses to user queries.

Abstract: Techniques are disclosed for generating statistical views in a database system. In one embodiment, a request is received to execute a database workload. One or more constraints pertaining to executing the database workload is retrieved. The database workload is evaluated to generate multiple statistical view candidates. The statistical view candidates are refined based on the one or more constraints. One or more statistical views are then generated based on the refined statistical view candidates.

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: One embodiment of the present invention is a wizard (e.g., software) for configuring database access middleware for optimal performance. The wizard asks a set of questions. The questions are presented to the user with a navigable UI, and are designed such that the user does not need database expertise to answer them. Based on the user's answers, the wizard generates a set of connect options and values to be used to optimize performance of the user's middleware. Users can use the wizard to determine whether currently selected options or values of a deployed application are optimal, and to determine if other options/values should be used that may improve the performance of the existing application. Also, a prospective customer that is evaluating middleware can use this wizard to tune the middleware for the intended application, thereby allowing that user to better assess how the middleware will perform.

Abstract: Exemplary embodiments provide a hybrid buffer pool for a database that includes a plurality of data pages contained in storage. The hybrid buffer pool comprises: a shared buffer pool of page frames containing dirty data pages that are modified after reading that will be written back to storage; an immutable buffer pool that temporarily contains read-only data pages from the storage; and a page multiplexer that identifies which ones of the data pages from storage to store in the immutable buffer pool based at least in part on information from a query processor.

Abstract: Systems and methods for evaluating analytic queries comprising disjunctive Boolean expressions are described. A method may include receiving an analytic query comprising a first disjunctive Boolean expression. The method may further include transforming the analytic query to obtain a transformed analytic query comprising at least one nondisjunctive Boolean expression and at least a second disjunctive Boolean expression. The method may also include evaluating the transformed analytic query, wherein complete evaluation of the at least one nondisjunctive Boolean expressions and the at least a second disjunctive Boolean expressions yields the same results as evaluation of the first disjunctive Boolean expression.

Abstract: Embodiments of the present application relate to a distributed data stream processing method, a distributed data stream processing device, a computer program product for processing a raw data stream and a distributed data stream processing system. A distributed data stream processing method is provided. The method includes dividing a raw data stream into a real-time data stream and historical data streams, processing the real-time data stream and the historical data streams in parallel, separately generating respective results of the processing of the real-time data stream and the historical data streams, and integrating the generated processing results.

Abstract: A method and system for analyzing user behavior as users search for items within an electronic marketplace is provided. A query is submitted by a user of the electronic marketplace, the query is processed to identify a series of actions or behaviors performed by the user in relation to the query and fingerprint information for the query is determined based at least in part on analyzing the actions. A classification for a query is determined based on the fingerprint information. In one embodiment, an electronic marketplace receives a query from a user, accesses a query classification database having fingerprint information, determines a fingerprint for the query based on the fingerprint information and dynamically modifies a user experience for the user based at least in part on the fingerprint information.

Abstract: Techniques for sharing item images based on a similarity score are described. For example, a machine receives an input item listing for an item from a user device. The machine accesses an existing image that may be associated with one or more existing item listings. The machine identifies a degree of similarity between the input item listing and the one or more existing item listings. The machine generates a similarity score for the existing image based on the degree of similarity. The machine selects one or more existing images corresponding to the one or more existing item listings based on the one or more existing images having corresponding similarity scores that exceed a threshold value. The machine transmits a communication to the user device in response to the receiving of the input item listing. The communication may include the one or more existing images.

Abstract: A method and a system are disclosed for predicting sales of item listings on a network-based system. For example, historical transaction data generated by the network-based system is accessed to create a prediction model. A feature predictive of an item being sold through the network-based system is selected. A training set is created by extracting the predictive feature from the historical transaction data. The prediction model is trained based on the training data set to predict the probability of an item listing being sold through the network-based system. The prediction model is used to rank search results, and the search results can be presented through the network-based system.

Abstract: Systems and methods are provided for searching and identifying quotes in response to a query from a user. Consistent with certain embodiments, systems and methods are provided for identifying one or more subject entities associated with the query and for identifying, from a database or from search results obtained in response to the query, a set of quotes corresponding to the one or more subject entities. Further, systems and methods are provided for determining quote scores for the identified quotes based on at least one of the relationship of each quote to the one or more subject entities, the recency of each quote, and the popularity of each quote. Additionally, systems and methods are provided for organizing the identified quotes in a rank order based on the quote scores and selecting quotes based on the rank order or based on the quote scores. In addition, systems and methods are provided for transmitting information to display the selected quotes on a display device.

Abstract: Techniques for organizing information, such as documents, presentations, web sites and web pages, audiovisual media streams, and the like are describe. This disclosed techniques include creating and using an interest graph to support the distribution of information to a user via a feed containing information items likely to be of interest to the user. An interest graph expresses the affinity between people and information—the likelihood that a particular piece of information is of interest to a particular person. The interest graph is based on an understanding of relationships, monitoring of user behavior, and analysis of each piece of information. The interest graph represents many kinds of relationships, including: between users and other users, users and items, and users and collections. The interest graph can be computed using data both from a set of items and from user behavior.

Abstract: Embodiments described herein are used to automatically generate a list of searchable terms from any text set, as text found in a repository of information, that then can be used in a variety of applications, from providing search results, to analyzing data sets, to building a variety of text generation tools, such as messaging and emails.

Abstract: A matching system and related methods for matching an input item or input item set with stored items and/or stored item sets, and methods for manufacturing and using same.

Abstract: Provided are systems and methods for determining, by a master queue service, that one or more database event records are present in a master input queue, wherein each of the one or more database event records corresponds to an occurrence of an event at a database, causing, by the master queue service, moving of the one or more database event records from the master input queue to a master output queue, determining, by the master queue service, one or more processes associated with the one or more database event records, and causing, by the master queue service, adding of the one or more database event records to one or more process queues for the one or more processes.

Abstract: Systems and methods are provided for analyzing entity performance. In one implementation, a method is provided that includes accessing a data structure comprising a plurality of interactions associated with multiple entities. The method also includes evaluating one or more interactions of the plurality of interactions associated with a consuming entity of the multiple entities. The method further includes determining whether the one or more interactions associated with the consuming entity comprise an identified location information of the consuming entity.

Abstract: A development platform system is disclosed that provides a development platform configured to create new and modified web-based applications. The development platform may be configured to search for and select a design layout template from available design layout templates stored on a database library. The development platform may further be configured to search for and select a data visualization template from available data visualization templates stored on a database library. The development platform may further be configured to generate a data visualization modification interface and accept a client device customization input to modify attributes of a data visualization. Templates that are modified by the development platform may be stored for subsequent look-up on a database library according to metadata describing attributes of the templates.

Abstract: In various embodiments, an active-active replication solution is provided with one generic PL/SQL stored procedure (e.g., a PL/SQL stored procedure) configured to handle all application tables' conflict detection and resolution. In various aspects, the generic stored procedure simplifies initial setup, maintenance and management of complex mission critical active-active replication projects.

Abstract: According to one embodiment of the present invention, a system uses parallel transaction messages for database replication. The system receives transaction messages from a source system via a plurality of parallel send queues in a receive queue. Each transaction message includes a message identifier indicating a commit order for that transaction. The system reads transaction messages in the receive queue in order in which they were committed against a source database based on the message identifier, and applies changes described by the transaction messages to a target database. Two or more transaction messages in the receive queue are applied to the target database in parallel. The system deletes transaction messages from the receive queue asynchronously to applying changes described by those transaction messages to the target database. Embodiments of the present invention further include a method and computer program product for parallel transaction messages in substantially the same manners described above.

Abstract: Methods, apparatus and computer program products implement embodiments of the present invention that include conveying first data from local regions of a local volume of a local storage system to a remote storage system having a remote volume with remote regions in a one-to-one correspondence with the local regions. While conveying the first data, a request is received to update a given local region, and the given local region is marked.

Abstract: A content platform cluster that comprises an array of nodes is logically partitioned. Using a web-based interface, an administrator defines “tenants” within the cluster, wherein a tenant has a set of attributes: namespaces, administrative accounts, data access accounts, and a permission mask. A namespace is a logical partition of the cluster that serves as a collection of objects typically associated with at least one defined application. Each namespace has a private file system with respect to other namespaces. This approach enables a user to segregate cluster data into logical partitions. Tenant information, including all associated namespaces, in the cluster (the “source cluster”) is replicated to at least one target cluster over a replication link. Preferably, replication is available for multiple tenants in the source cluster, and a replication algorithm ensures that a particular tenant can be added to the replication link without stalling the progress of other tenants.

Abstract: In a particular embodiment, a method includes sending a text string from a source device to a destination device. The destination device includes a unique identifier repository having a plurality of globally unique identifiers mapped text strings, relationship data defining associations between the plurality of globally unique identifiers, and meta-data related to the text string. Each of the plurality of globally unique identifiers includes a data value that is shared by a plurality of data sources as an identifier associated with information related to the text string. The method further includes receiving data including one or more globally unique identifiers, associated relationship data, and associated meta-data from the destination device at the source device in response to sending the text string. Additionally, the method includes storing the received data at a memory of the source device for use in searching and relating search results received from multiple data sources.

Abstract: Method, media, and systems for compressing objects, comprising: receiving a request to write a first object including a first key and a first value, wherein the first object is of a given type; receiving a request to write a second object including a second key and a second value, wherein the second object is of the given type; classifying the first object to a compression dictionary according to at least one rule based on a value of the first object and/or the key of the first object; classifying the second object to the compression dictionary according to at least one rule based on a value of the second object and/or the key of the second object; and compressing the first object and the second object based on the compression dictionary.

Abstract: Systems and methods for serving dynamic content (such as advertisements) in response to dynamic content requests are presented. More particularly, systems and methods for serving dynamic content from dynamic content portfolios directed to trending events and/or topics are presented. Upon receiving a dynamic content request, content classifications corresponding to the requested, published content (i.e., the requested content) that included reserved dynamic content space which initiated the dynamic content request are determined. A current trend is identified in a content classification when the dynamic content request volume for the current trend period exceeds the standard/expected dynamic content request volume for the current trend period by at least a threshold amount. When a trend is detected, candidate content portfolios directed to the trending content classification are selected from a set trending content portfolios.

Abstract: Entries within a participant list of an electronic communications system may be categorized automatically into one or more groups based on attributes of users represented in the participant list. Categorizing users includes maintaining a list of identifiers that are selected by a first user and for which online presence information is made perceivable through the list. The list includes one or more categories into which the identifiers are categorized. At least one attribute associated with an identifier for which online presence information is to be made perceivable through the list and attributes stored relative to at least one of the categories are accessed. The attributes associated with the identifier are compared to the stored attributes. Based on results of the comparison, at least one category within the list that corresponds to the identifier is identified, and the identifier is categorized into the identified category.