Abstract: A multi-master replication system is disclosed. The multi-master replication system allows a large set of peer instances to collaboratively replicate data to each other.

Abstract: A method, computer program product and system for generating and maintaining synthetic context events. The steps include searching a data structure of synthetic context-based objects and associated data for a pattern of context exhibited at a first specified frequency within a first specified time period; combining the synthetic context-based objects and associated data exhibiting the pattern of context exhibited at the first specified frequency within the first specified time period into a synthetic context event; and optimizing and maintaining the synthetic context event by searching the data structure for additional synthetic context-based objects and associated data exhibiting a same pattern of context at a second specified time period different than the first specified time period and adding the additional synthetic context-based objects and associated data to the synthetic context event.

Abstract: A server for providing a city street search service includes a street information database configured to store city street images, a feature selection unit configured to select at least one feature according to a predetermined criterion when a city street image for searching and two or more features for the image are received from a user terminal, a candidate extraction unit configured to extract a candidate list of a city street image, a feature matching unit configured to match the city street image for registration included in the extracted candidate list and the at least one selected feature, and a search result provision unit configured to provide the user terminal with a result of the matching as result information regarding the city street image for searching.

Abstract: A data marketplace infrastructure allows a data source company or a third party to associate to a data feed with a customizable preview application having analytic and visual features (e.g., business logic and a user interface). A potential customer can use discovery services of the data marketplace infrastructure to identify one or more data feeds offering sample data in a domain of interest of the potential customer. The data feed can transmit the customizable preview application to allow the potential customer to interact with the data from the data feed before purchasing the data. The potential customer may also customize the preview application so as to change the default application behavior in a manner that improves the potential customer's understanding and appreciation of the data feed.

Abstract: A method for guided keyword-based exploration of data stored in a database includes providing, with a processing device, valid query templates for the data, wherein the provided valid query templates include static parts and dynamic parts; selecting those of the provided valid query templates that match a user-provided keyword; generating valid queries from the selected valid query templates using the data; and querying the data using a user-selected valid query selected from the generated valid queries.

Abstract: In one embodiment, techniques are provided for converting a CAD description maintained in a first storage format (e.g., a file-based storage format) of a source repository to a second storage format (e.g., a relational database-based storage format) of an output repository. The techniques may, generate a single, coherent representation from spatially ambiguous “fragments” by generating an acyclic model graph for each graphical view, and then storing models of the acyclic model graph in the second storage format (e.g., the relational database-based storage format). The techniques may further produce a post-conversion CAD description that preserves human-readable names and information relationships related to levels by examining attachment specific copies of level structures (i.e. levels and attached levels) referenced from attachments, and generating from these categories and subcategories in the second storage format (e.g., the relational database-based storage format).

Abstract: A knowledge model “overlay” for organizing and analyzing large, dynamic data volumes is implemented as a hypergraph that manifests as a result of a distributed theory-driven data source transformation process. This process maps exponentially growing data into an asymptotically limited information space. Within this space, real-world entities (e.g. people, computers, cities, Earth) and their complex interdependencies (e.g. social networks, connectivity, causal relationships) are represented as attributed hypergraph elements (i.e. both hypervertices and hyperedges). Attributes are represented as state vectors affixed to any hypergraph element. Transformation of source system data into this overlay structure is accomplished with minimal data movement and replication using a universal “pointer” like mechanism that is managed in a decentralized fashion by the respective transformation components.

Abstract: This application discloses a system for processing requests for data in production and archive/backup databases. The system stores a mapping of data in production and archive databases to multiple different data storage locations, including a production system storing at least one production database and an archive system storing at least one archive database. The system receives a data request from an application component, which manages or receives data from a user interface and has received the data request directly from the user interface. The system translates the data request to one or more database queries based on the mapping. The system causes to execute the database queries against data on the production or archive system. The system returns a result of executing the one or more database queries to the application component, where the application component returns the result to the user via the user interface.

Abstract: A processor selects a first database and a second database from a plurality of databases. The processor determines one or more terms found in the first and second database, wherein each term of the one or more terms includes metadata of a database of the plurality of databases. The processor identifies one or more common terms between the first database and the second database and determines the one or more common terms found in each of a plurality of groups of databases of the plurality of databases, wherein each group of databases corresponds to a number of databases which constitute the group of databases. The processor determines a similarity score between the first database and the second database of the plurality of databases based on the one or more common terms found in each group of databases of the plurality of databases.

Abstract: Described are techniques for request processing. A server receives from a client a request for first data to be returned to the client. The first data includes a first property of an object. The object is included in an object model and includes a predefined property. The first property is not a predefined property of the object and is a new property defined using an expression included in the request. The request includes any of the predefined property and a constant. First processing is performed at the server to service the request and obtain the first data. At the server in accordance with the first processing, a response to the request including the first data is generated.

Abstract: An in-memory database system stores the entirety of a database that is being operated on by a database system within main memory. The database includes a table that comprises a plurality of rows including a particular row. The database table comprises a first version of the particular row having a first valid time, and a second version having a second valid time. Index(es) are associated with the database table. Each index references the plurality of rows, including referencing the first and second versions of the particular row. A transaction acting on the first version of the particular row is executed. The first version of the particular row is visible to the transaction based on the first valid time and the second version of the particular row being not visible to the transaction based on the second valid time.

Abstract: A building management system that determines space utilization in a building. The building management system comprises room utilization sensors, such as occupancy sensors, a gateway that gathers raw occupancy data records from the occupancy sensors, and at least one processor. Each raw occupancy data record comprises an occupancy state associated with a timestamp. The processor is configured for normalizing the raw occupancy data records into normalized occupancy data records each comprising a time segment and an occupancy state indicating whether for a given time segment a room is occupied. The processor is further configured for structuring the normalized occupancy data records by associating each normalized occupancy data record with a space node corresponding to a room in the building from where the raw occupancy data record was collected and associating each space node with a set of tags, each tag defining a single state from a plurality of states.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enforcing the category diversity or sub-category diversity of POIs that are identified in response to a local search. According to one implementation, a method includes receiving a request to identify points of interest (POIs), obtaining data identifying (i) candidate points of interest (POIs) that satisfy the request, (ii) a respective category associated with each candidate POI, and (iii) a non-scaled score associated with each candidate POI, and ranking, for each of one or more of the categories, the candidate POIs associated with the category, based on the respective non-scaled scores.

Abstract: A ValueID corresponding to a value to be searched for in a database column can be determined by finding a match in a dictionary for the database column. A row of an index vector for the database column at which to begin a scan for the ValueID can be identified by reading a ValueID lookup table that maps each unique ValueID to a starting position in the index vector for the database column. The ValueID can not occur in the index vector prior to the starting position. The index vector can be scanned beginning at the starting position to find at least one occurrence of the ValueID corresponding to the value being searched, and a result that includes one or more row locations in the database column corresponding to the at least one occurrence in the index vector of the ValueID corresponding to the value being searched can be returned.

Abstract: A method and system for automatically determining a processing path is provided. The method includes generating an input criteria associated with performing a hardware apparatus implemented process. Metadata describing the input criteria is generated and stored. Weighting factors associated with the metadata are generated and a specialized hardware apparatus executing the hardware apparatus implemented process is enabled. Measurement characteristics associated with conditions resulting from the specialized hardware apparatus executing the hardware apparatus implemented process are retrieved from a plurality of hardware sensors. A resource database catalog for hardware based data processing resources is queried and an optimization process for determining an optimized processing path for processing the metadata with respect to the resource database hardware based data and the measurement characteristics is executed.

Abstract: A first question may be received. A first tag may be identified. The first tag may correspond to a first demographic trait. The first tag may be for use in providing a context for generating a first answer estimate to the first question. The first answer estimate may be generated using natural language processing and based on the first tag.

Abstract: A method includes sending a set of digest list requests to a set of storage units regarding integrity data for a set of encoded data slices. The method further includes receiving, in response to the integrity data requests, the corresponding integrity data from at least some storage units of the set of storage units regarding at least some of the encoded data slices of the set of encoded data slices to produce a set of integrity data. The method further includes determining whether an inconsistency exists in the set of integrity data. When the inconsistency exists, the method further includes identifying an inconsistent encoded data slice of the at least some of the encoded data slices is inconsistent with other encoded data slices of the at least some of the encoded data slices. The method further includes updating the inconsistent encoded data slice to resolve the inconsistency.

Abstract: Techniques for improving complex database queries are provided. A determination is made whether to adopt a static or dynamic query execution plan based on metrics. When the dynamic query execution plan is used, a request fragment of the request is planned and the corresponding plan fragment is executed. The processed fragment provides feedback related to its processing to the remaining request and the process is repeated on the remaining request until the request is completed.

Abstract: A method and apparatus is disclosed herein for maintaining deduplication metadata on disk separate from an in-memory deduplication file system for a deduplication computing system. The method may include reading deduplication metadata from a first memory of a deduplication computing system. Furthermore, the method may include maintaining deduplicated data for a file system in a second memory, and maintaining the deduplication metadata that describes the deduplicated data of the file system in the first memory of the deduplication computing system, wherein the first memory is a different type of memory and separated from the second memory in the deduplication computing system. Furthermore, the method may include accessing the deduplication metadata in the second memory in response to receipt of a request by the deduplication computing system to perform a first operation with deduplicated data of the file system in the second memory.

Abstract: A search system interface is described. Known search system interfaces are largely unable to find composite articles on the basis of a description of the distribution of content types within them. A problem with providing such a search interface is the laboriousness of generating a suitable query. To address this problem, a display is provided with a key showing content types and associated map symbols. Also provided on the display is a search mapping area, which takes advantage of the fact that parts of text documents, and many other types of searchable items, can be referenced by one or more ordinal values, by having an easily perceivable relationship between position in the search mapping area and position within a target document.