Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table build phase involves executing vectorized instructions to determine whether a bucket in a hash table includes a free slot for inserting a key. A number of data elements from the bucket are loaded in a register. A vectorized instruction is executed against the register may be used to determine a position, within the register, that contains the “smallest” data element. If the data element at that position is zero (or negative), then it is determined that the corresponding position in the bucket is an available slot for inserting a key and corresponding data value.

Abstract: Many websites publish variants of their web pages based on language and region. However, when a user is directed toward the incorrect web page for the user's language preference, it there is not a simple way for the user to select the appropriate localized or region specific version of the web page. According to an embodiment, a language preference from a user may be received. A first language for a first web page may be identified and the first web page may be received by a computing device of the user. A second language for a second web page may be identified. The second web page may comprise an alternate version of the first web page. The first web page or the second web page may be selected according to the language preference of the user and the selected web page may be presented to the user.

Abstract: Techniques include: receiving a search query; identifying content responsive to the search query; identifying one or more members of a social networking service that have an association with identified content; and outputting, to a computing device, data corresponding to the one or more members, where data corresponding to the one or more members is for generating display areas, and where the display areas are for obtaining information about corresponding members and for display along with search results.

Abstract: A hypertext transfer protocol (HTTP) request that includes embedded scripted code that specifies requested data search, search result data manipulation, and manipulated search result data visualization processing is received at a server. The received embedded scripted code that specifies the requested data search, search result data manipulation, and manipulated search result data visualization processing is executed. Visualized manipulated search results are generated as output of the execution of the received embedded scripted code. The visualized manipulated search results are returned in response to receiving the HTTP request that includes the embedded scripted code.

Abstract: A method and a test system for specifying a predetermined degree of inconsistency for test data are disclosed. The test system obtains a test policy, which specifies a predetermined degree of inconsistency between write operations and subsequent read operations on a set of data and subsequently receives a request to provide test data to an application. In response to the request to provide test data to the application the test system generates a set of test data including a plurality of entities retrieved from the set of data, based at least in part on the test policy. The test data includes a respective entity that is not consistent with a previous write operation. The test system further provides the set of test data to the application. The application optionally processes the set of test data to produce results, which are used to determine performance of the application.

Abstract: The present invention generally relates to systems and methods for identifying a workflow, from a set of workflows, that best match a given query partial workflow. In addition to identifying the best match, the systems and methods can identify the portion of the workflow that best matches the query partial workflow.

Abstract: Various systems, non-transitory computer readable media, and methods reorganize data records of a database in response to an efficiency parameter. A system may use an efficiency parameter that indicates a satisfactory level of organizational efficiency of at least a portion of a database table having a group of rows stored using a plurality of data blocks. The system may determine an efficiency of the group of rows based on a number of data block changes that occur during a sequential access of the group of rows. When the determined efficiency is less than the efficiency indicated by the efficiency parameter, the server may generate a control card to reorganize the group of rows when the efficiency is not satisfactory. The control card is used by an online reorganization process that reorganizes the group of rows.

Abstract: A system, including both an OLTP database and a warehouse database, that is configured to manage the coordination between the OLTP database and the warehouse database. An aspect relates to a combined OLTP and warehouse database which manages duplicate copies, in both the OLTP database and the warehouse database, of data expected to have a relatively high update and query rate. Data which has a low update and query rate is removed from the OLTP database, such that it remains only in the warehouse database. Updates of the duplicate copy data are performed in the OLTP. Periodically, for example every several minutes, data recently changed in the OLTP database is copied to the warehouse database. Queries are optionally primarily handled by the warehouse database, and are supplemented, when necessary, by data from the OLTP database.

Abstract: Provided is a process for identifying a new business listing, the process including: identifying, from a log of local search queries, a term that does not correspond to a name of a business listing; determining a number of recent search queries containing the term and a number of historical search queries containing the term; determining that a rate based on the number of recent search queries exceeds a threshold rate based on the number of historical search queries; and identifying the term as a name of a new business listing.

Abstract: A method of accessing data in a database management system includes in a first storage structure, storing one or more datasets for each of plural devices, each dataset comprising unordered timestamped data elements indicating statuses of a particular device related condition at different points in time, in a second storage structure, storing and mapping between: device identifiers identifying the devices, condition identifiers identifying the device related conditions, and timestamps identifying when two temporally consecutive data elements of a given dataset indicate different statuses, receiving a new data element indicating a status of one particular device related conditions, storing the new data element in the first storage structure, determining whether or not the status indicated by the new data element is different from the status indicated by a temporally preceding data element stored in first storage structure, and updating the timestamps if the determination is positive.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for computerized travel services. One of the methods includes receiving natural feature mapping data, the natural feature mapping data representing geographic footprints of multiple natural features; receiving political feature mapping data, the political feature mapping data representing geographic footprints of multiple political features; classifying the natural features as a destination or not a destination, including: classifying at least one of the natural features as a destination based at least in part on determining that the geographic footprint of the natural feature overlaps with more than one of the geographic footprints of the political features, and storing data representing the natural features classified as a destination in a geographic data store.

Abstract: Duplicate storage elimination is performed in units of block data generated by dividing a data stream into arbitrary-sized blocks. Further, sub-block data is generated by further dividing the block data into a plurality of pieces of data, and sub-address data based on the data content of each of the pieces of sub-block data is stored in a predetermined storage device. As such, duplicate storage elimination is also performed in sub-block data units based on the sub-address data.

Abstract: The present invention generally relates to a computerized system and method for tracking and displaying data identifying the geographic relevance of website listings on Internet search engines, parked web pages, ISP redirect web pages, and other similar web listing services without requiring extra input from Internet users. Each time an Internet user clicks on a website link provided on one of these web services, the software of the present invention tracks that person's decision in selecting the link, along with his or her geographic location. The software automatically collects and stores this information in a database in a format that can be quickly accessed and used in the future when other Internet users perform the same keyword search or visit the parked/redirect page again.

Abstract: An embodiment method for massively parallel processing includes assigning a primary key to a first table in a database and a foreign key to a second table in the database, the foreign key of the second table identical to the primary key of the first table, determining a number of partition groups desired for the database, partitioning the first table into first partitions based on the primary key assigned and the number of partition groups desired, partitioning the second table into second partitions based on the foreign key assigned and the number of partition groups desired, and distributing the first partitions and the second partitions to the partition groups as partitioned. An embodiment system for implementing the embodiment methods is also disclosed.

Abstract: Privacy-protected search is described, including obtaining a set of search results responsive to a search input from a first user; determining, from the search results and based on a social graph, that a first search result associated with a second user is indicated as keeping an identity of the second user hidden; determining whether other search results in the set are indicated as keeping respective identities of associated other users hidden; calculating a score for the first search result based at least on the determinations, the score indicates the likelihood of the first user guessing the identity of the second user; and determining whether to provide to the first user the first search result based on the score for the first search result.

Abstract: When multiple regional data clusters are used to store data in a system, maintaining cache consistency across different regions is important for providing a desirable user experience. In one embodiment, there is a master data cluster where all data writes are performed, and the writes are replicated to each of the slave data clusters in the other regions. Appended to the replication statements are invalidations for cache values for the keys whose values have been changed in the master data cluster. An apparatus in the master data cluster logs replication statements sent to the slave databases. When a slave database fails, the apparatus extracts the invalidations intended for the failed database and publishes the invalidations to a subscriber in the region of the failed database. The subscriber sends the invalidations to the local caches to cause stale data for those keys to be deleted from the caches.

Abstract: Methods, computer program products and systems are directed to receiving a query regarding an information architecture, selecting a set of nodes based on the query, from a plurality of nodes in a weighted linked graph, the weighted linked graph comprising the plurality of nodes and a plurality of pathways, each of the plurality of nodes comprising a source of information regarding the information architecture, each of the plurality of pathways connecting one of the plurality of nodes to another of the plurality of nodes, each of the plurality of pathways comprising a weight, determining a path from the plurality of pathways that passes through all of selected nodes, and presenting the path in response to the query.

Abstract: Implementations of the present disclosure involve a system and/or method for storing one or more data files in an n-level directory tree of a data storage system. In general, the system and/or method computes an n-byte value from a data file name which is used to create a directory path in the data storage system, where parts of the n-byte value are used to form each directory name in the directory path. Storage and retrieval of a data file is performed by storing in or retrieving data files from the computed directory. In one embodiment, the calculated n-byte value is obtained by computing the value with a cyclic redundancy check (CRC) algorithm. Use of the CRC algorithm to compute the directory path provides a balanced set of directories and number of data files that is repeatable such that location and retrieval of the data file is accomplished without the need to search through each directory of the system.

Abstract: A database query optimizer allows specifying a performance specification for a query. When an access plan is created, the actual performance for executing the query using the access plan is determined and compared to the performance specification for the query. If the actual performance does not satisfy the performance specification for the query, the query optimizer autonomically generates a different access plan to see if the performance improves. If an access plan that meets the performance specification is generated, the new access plan is stored in the access plan cache for the query. If no access plan can be generated that meets the performance specification for the query, the access plan that provided the best performance is selected and stored in the access plan cache for the query.

Abstract: Aspects include data masking in database operations including intercepting a database query and identifying masked data in the query. The masked data in the query is unmasked by substituting the masked data with equivalent real values. The unmasked query is sent to the database engine, and a result provided by the database engine in response to the unmasked query is intercepted. The values in the result that correspond to sensitive information are identified. The result is masked by substituting the values in the result corresponding to sensitive information with masked equivalents. The masked result is returned to a user.