Abstract: A query processing method including decomposing an SQL into logical plans based on data source feature information, to obtain a logical plan set, where the data source feature information is stored in an internal storage space of the query engine; generating physical plans for the logical plan set based on the data source feature information, to obtain a physical plan set; determining query costs of the physical plan set based on the data source feature information, to obtain a physical plan with a highest priority; and executing the physical plan with the highest priority, to obtain a query result queried by a user.

Abstract: Various embodiments are described regarding admitting for performance ordered operations of atomic transactions across a distributed database. In some embodiments, a node of a distributed system receives and accumulates requests for operations over a period of time. The node can then order the requests based on certain criteria, such as by timestamps of associated transactions. The node can then perform an admission control on the ordered requests, until a capacity of the node to perform the requests for operations is exceeded. During the admission control process, those requests for operations received within the period of time that are not admitted can be rejected by the node.

Abstract: A system for ledger data includes a block repository, a metadata database, and a processor. The block repository stores verified secure ledger data in one or more blocks that are cryptographically linked. The metadata database stores metadata information for the one or more blocks in the block repository. The processor is configured to receive a request to create a block content and to determine the block content for a block to be stored in the block repository and metadata content to be stored in the metadata database associated with the block to be stored in the block repository, wherein the metadata content includes one or more flags and source information; and broadcast the block to be stored in the block repository to be approved by participating nodes in a network.

Abstract: Described is a travel-based geo-paired information system. The system includes a server having a memory storing geo-paired information that includes content regarding or related to a point of interest. The system also includes a user computing device coupled to the server. The server may be programmed to receive location information from the user computing device. The server may also be programmed to automatically process the location information and determine whether a location of the user computing device is within a predetermined distance from a point of interest geolocation. Then the server may automatically find and retrieve geo-paired information corresponding to or paired to the point of interest geolocation and automatically deliver to the user computing device, for presenting, the content related to the point of interest corresponding to the location of the user computing device.

Abstract: A technique is described for merging multiple lists of ordinal elements such as keys into a sorted output. In an example embodiment, a merge window is defined, based on the bounds of the multiple lists of ordinal elements, that is representative of a portion of an overall element space associated with the multiple lists. Lists of elements to be sorted can be placed into one of at least two different heaps based on whether they overlap the merge window. For example, lists that overlap the merge window may be placed into an active or “hot” heap, while lists that do not overlap the merge window may be placed into a separate inactive or “cold” heap. A sorted output can then be generated by iteratively processing the active heap. As the processing of the active heap progresses, the merge window advances, and lists may move between the active and inactive heaps.

Abstract: Embodiments of the disclosure extract annotations from web pages. The annotations are combined with search results and/or advertisements to allow the user to better understand the content of the search result or advertisement landing web page. A visual snapshot of the web page is taken. Visual processing extracts information from the visual representation. The HTML, for the web page is also analyzed and various pieces of information extracted. The information from the visual processing is combined with the information extracted from the HTML. The combined information is evaluated and information for the annotations are selected. The annotations are then combined with the search results and/or advertisements.

Abstract: A computer-implemented system and method for a data leakage and misuse detection system comprises receiving an evaluation dataset A, and building a signature of the evaluation dataset A (sig(A)), where A signature of a dataset is a multi-level evaluation data abstraction representation of the dataset. The method further comprises building a signature for each of existing datasets B (B1, B2, . . . , Bn) (sig(Bx)) that are stored in a memory. The method then compares the sig(A) with each of the sig(Bx)s. A similarity score is derived based on the comparing, and responsive to determining the similarity score exceeds a predefined threshold, the method comprises generating an activity related to the determination.

Abstract: A system includes a first module that asynchronously communicates with a second module. The first module processes a set of digital transactions and transmits instructions for the second module to process the same set of digital transactions. The first module maintains a first aggregated hash value corresponding to the set of digital transactions that have been processed. The first aggregated has value is calculated using a commutative and associative hash function. The second module maintains a second aggregated hash value corresponding to a second set of digital transactions processed by the second module. The first and second aggregated hash values are compared to determine the second module processed the same digital transactions as the first module.

Abstract: Some embodiments provide a non-transitory machine-readable medium stores a program. The program receives a query for data that includes a join operation. The program further generates a plurality of candidate query execution plans based on the query, each candidate query execution plan comprising a set of reduction operations. The program also determines a plurality of execution costs associated with the plurality of sets of reduction operations in the plurality of candidate query execution plans. The program further selects a query execution plan from the plurality of candidate query execution plans based on the plurality of execution costs. The program also executes the query execution plan to generate a set of query results for the query.

Abstract: Disclosed approaches for performing a Burrows-Wheeler transform (BWT) of a sequence of data elements, S, include determining sets of less-than values and sets of equal-to values for the data elements. Index values are determined for the data elements based on the sets of less-than values. Each index value indicates a count of data elements of S that a data element is lexicographically greater than. Rank values are determined for the data elements of S based on the sets of less-than values and the sets of equal-to values. Each rank value indicates for the data element an order of the data element in the BWT relative to other ones of the data elements of equal value. Positions in the BWT of S for the data elements are selected based on the index values and rank values, and the data elements are output in the order indicated by the respective positions in the BWT.

Abstract: A technique is described for merging multiple lists of ordinal elements such as keys into a sorted output. In an example embodiment, a merge window is defined, based on the bounds of the multiple lists of ordinal elements, that is representative of a portion of an overall element space associated with the multiple lists. Lists of elements to be sorted can be placed into one of at least two different heaps based on whether they overlap the merge window. For example, lists that overlap the merge window may be placed into an active or “hot” heap, while lists that do not overlap the merge window may be placed into a separate inactive or “cold” heap. A sorted output can then be generated by iteratively processing the active heap. As the processing of the active heap progresses, the merge window advances, and lists may move between the active and inactive heaps.

Abstract: Provided are a data indexing method, a data querying method and an electronic device. The data indexing method includes: creating a clustered index for a plurality of data records according to values of preset fields within the plurality of data records, wherein the plurality of data records are configured to store data files, and the values of the preset fields are field values of the clustered index; plotting, for each of the data records, a data distribution diagram of offsets versus the data records in the data file; and performing curve-fitting on the data distribution diagram to obtain an index relation containing correspondences between the field values and the offsets, so that the offset is calculated according to the field values of the data record to be queried, and thereby the data record is queried.

Abstract: A computer processor includes a memory unit, a processor cache and a hardware merge sort accelerator. The memory unit stores key values to be sequentially sorted. The processor cache obtains tree data from the memory unit indicating the key values. The hardware merge sort accelerator is configured to generate a master tournament tree based on the key values and perform a tournament sort that determines a first winning key value based on the master tournament tree. The hardware merge sort accelerator further speculates a second winning key value based on the master tournament tree. The speculated second winning key value is a next sequential winning key value of the tournament sort.

Abstract: Example systems and methods of classifying web visitor sessions based on clickstreams are presented. In one example, a plurality of web pages of a website is organized into a plurality of web page categories. A clickstream of each visitor to visit the plurality of web page categories of the website are divided into a plurality of visitor sessions. A mathematical distance between each of the plurality of visitor sessions is determined using a visitation metric based on the web page categories. Each of the visitor sessions is classified into a target group or a non-target group based on the mathematical distance between each of the visitor sessions and on an identification of at least one of the visitor sessions with an event corresponding to the target group.

Abstract: Embodiments are directed to replicating data in distributed storage. A replication message may be retrieved from a message queue associated with a source table. The replication message may include a row identifier. One or more target storages within a same replication group as the source table may be identified. A row from each of the one or more target storages may be obtained corresponding to the row identifier. A winning row may be determined from the obtained rows based on a latest timestamp of the row. A replication operation may be created based on the winning row. The replication operation may be performed on the obtained rows from each of the target storages.

Abstract: A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. Multiple key values are selected for the multiple records. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing the multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file.

Abstract: A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file. The selected multiple key values include all key values that satisfy a condition.

Abstract: Embodiments are directed towards dynamic semantic models having multiple indices. Source data may be provided to a network computer from at least one separate data source. A raw data graph may be generated from the source data such that the structure of the raw data graph may be based on the structure of the source data. Elements of the raw data graph may be mapped to a concept graph. Concept instances may be generated based on the concept graph, the raw data graph, and the source data. Model-identifiers (MIDs) that correspond to the concept instances may be generated to include at least a path in the concept graph The MID values may be indexed into a plurality of indices based on a content-type of the data associated with the MIDs. In response to a query, a result set may be generated that includes result MIDs.

Abstract: A system ranks results. The system may receive a list of links. The system may identify a source with which each of the links is associated and rank the list of links based at least in part on a quality of the identified sources.

Abstract: A mechanism is provided for cross-allocated block repair in a mounted file system. A set of cross-allocated blocks are identified from a plurality of blocks within an inode of the mounted file system, based on a corresponding bit associated with each cross-allocated block in a duplicated block information bitmap being in a first identified state. The set of cross-allocated blocks are repaired using a user-defined repair process. Then one or more of the set of cross-allocated blocks are deallocated based on results of the user-defined repair process.

Abstract: Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Abstract: Techniques for external application-directed data partitioning in data exported from a parallel database management system (DBMS) are provided. An external application sends a query, a total number of requested access module processors (AMPs), and an application-defined data partitioning expression to the DBMS. The DBMS executes the query with the results vertical partitioned on the identified number of AMPs. Individual external mappers access their assigned AMPs asking for specific partitions that they are assigned to process the query results.

Abstract: A customized, topical database and methods for constructing and using such a database are provided. Selection and indexing of articles is done by experts in the topic with which the database is concerned. As a result, articles are indexed in a manner that allows facile, rapid retrieval of highly relevant articles with few or no false positives.

Abstract: A computing device maintains an input history in memory. This input history includes input strings that have been previously entered into the computing device. When the user begins entering characters of an input string, a predictive input engine is activated. The predictive input engine receives the input string and the input history to generate a candidate list of predictive inputs which are presented to the user. The user can select one of the inputs from the list, or otherwise continue entering characters. The computing device generates the candidate list by combining frequency and recency information of the matching strings from the input history. Additionally, the candidate list can be manipulated to present a variety of candidates. By using a combination of frequency, recency and variety, a favorable user experience is provided.

Abstract: Methods and apparatus to classify text communications are disclosed. An example method includes determining a first score indicating a likelihood that a text belongs to a first classification mode by combining a first sentence score and a second sentence score retrieved from an index, the first sentence score indicating a probability that a first sentence in the text belongs to the first classification mode, the second sentence score indicating that a second sentence following the first sentence belongs to the first classification mode, determining a second score indicating a likelihood that the text belongs to a second classification mode, comparing the first score to the second score, classifying the text as the first classification mode when the first score is greater than the second score, and determining a confidence level that the text belongs to the first classification mode by dividing the first score by the second score.

Abstract: A plurality of segments in an e-mail collection by parsing content of e-mails is generated. Corresponding segment signature for each segment is created and a signature index is populated using the generated segment signatures. After receiving a query e-mail, a plurality of query segments in the query e-mail is generated using content of the query e-mail and corresponding query segment signature for each query segment is generated. A query root segment is identified and corresponding query root segment signature is generated. A set of root segment signatures of the signature index is identified and the query root segment signature is compared with each root segment signature from the signature index. A subset of the signature index is identified, using a match between the root segment signature and the query root segment signature. An e-mail thread hierarchy is built using the identified subset of the signature index.

Abstract: A method of processing a query in a distributed database implemented across a set of nodes includes receiving a query. The query is divided into split characterization queries. The split characterization queries are distributed to worker nodes. Each worker node stores a partition of the distributed database with encoded textual objects and pre-defined indices characterizing encoded textual object fragments. The split characterization queries are executed at the worker nodes to obtain preliminary information about query results. Executing the split characterization queries includes matching query fragments associated with the split characterization queries with encoded textual object fragments of the pre-defined indices to produce fragment matches representative of the size of the query results. For each split characterization query the preliminary information about query results includes a fragment count, a database partition identification, and a database host name.

Abstract: An approach is provided for initiating generation of a media compilation based on one or more sampling criteria. A sampling platform determines at least one subset of one or more media items captured of at least one event. The sampling platform also partitions the at least one subset of the one or more media items into one or more bins and generates at least one compilation of the at least one subset of the one or more items based, at least in part, on whether the one or more media items in the one or more bins at least substantially meet one or more sampling criteria.

Abstract: A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. Multiple key values are selected for the multiple records. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing the multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file.

Abstract: A method for high-speed scheduling and arbitration of events for computing and networking is disclosed. The method includes the software and hardware implementation of a unique data structure, known as a pile, for scheduling and arbitration of events. According to the method, events are stored in loosely sorted order in piles, with the next event to be processed residing in the root node of the pile. The pipelining of the insertion and removal of events from the piles allows for simultaneous event removal and next event calculation. The method's inherent parallelisms thus allow for the automatic rescheduling of removed events for re-execution at a future time, also known as event swapping. The method executes in O(1) time.

Abstract: The present technology is directed to improving the conversion rate of invitational content that is provided to the user of an interactive, content-receiving-and-displaying device. The content of a large number of primary-content sources is analyzed and keyword and/or other context-providing information is extracted from the primary-content sources. The keyword and/or other context-providing information is used to index the primary-content sources into an index according to a hierarchical taxonomy; the hierarchical taxonometric index is used to identify primary-content sources with which a given item of invitational content correlates; and the given item of invitational content is delivered to a user in response to the user accessing a primary-content source with which the given item of invitational content correlates.

Abstract: Queries targeting various data sources are processed in a query processing pipeline that parses the query into a set of operations (e.g., an expression tree or a translated SQL query) using a set of query operators, each handling a particular type of operation. The query operators are often designed in an unspecialized manner, such that each query operator handles one query operation in an atomic, generic manner (e.g., sorting generic data items for an ORDER BY clause.) More efficient queries may be devised by including specialized queries that operate in common but special cases, such as a sorting of a particular data type (e.g., a floating-point number sort) or a sequence of two or more operations that are often performed together (e.g., a WHERE test of an attribute followed by a SELECT of the same attribute.) The use of specialized operators may result in the formulation of more efficient queries.

Abstract: An entity using a computing device can upload searchable data to a network service to be indexed and stored. The data can include a plurality of data fields, each data field having one or more associated values. The network service can analyze the data fields and their respectively associated values to determine data field types for the data fields and search options to be enabled for the data fields. Based at least in part on the data field types and the search options, the network service can generate a search index configuration/schema. Based at least in part on the generated search index configuration/schema, the network service can generate a search index for the data. In some embodiments, the network service can also convert the data into a format compatible with the search index.

Abstract: An information processing apparatus is disclosed that includes a processor, a storage device, a display device that displays a list of files accessible by the processor which list is sorted using an item of attribute information of the files as a sort key, a storing unit that stores information pertaining to display positions of the files within the list and information pertaining to the sort key used to sort the list in the storage device, a selecting unit that selects another item of attribute information of the files as a selected sort key, a sorting unit that executes re-sorting operations on the list using the selected sort key and generates a re-sorted list to be displayed by the display device, and a restoring unit that uses the information stored in the storage device to restore the re-sorted list back to the list displayed prior to execution of the re-sorting operations.

Abstract: A system ranks results. The system may receive a list of links. The system may identify a source with which each of the links is associated and rank the list of links based at least in part on a quality of the identified sources.

Abstract: The sort processing of keys to be sorted, which keys are expressed as bit strings involves a classification processing. In the classification processing, a bit string comparison between a reference key and a key which is an object of the classification is performed, and a difference bit position is obtained that is the bit position of the first bit that differs in the bit string comparison and the keys to be sorted are classified by the difference bit position into key groups with the same difference bit position.

Abstract: A computer-implemented method is provided, according to which, an indication of a plurality of attributes of user interaction with one or more electronic messages in a user account is received, a rank value for each of the one or more electronic messages based on the plurality of attributes of user interaction with the one or more electronic messages is determined, the one or more electronic messages in the user account based on the determined rank value are sorted, and the sorted one or more electronic messages are provided for display in accordance with the determined rank value.

Abstract: A system and method for caching and/or synching shared media items in a media sharing system are provided. In one embodiment, a user device of a user joins a media sharing system including the user device and one or more other user devices connected via a network such that the user of the user device has access to one or more shared media collections hosted by the one or more other user devices. Shared media items from the one or more shared media collections are scored. The user device then obtains shared media items scored above a defined threshold from the one or more other user devices hosting the one or more corresponding shared media collections and stores those shared media items in local storage. In one embodiment, the local storage is temporary storage, such as a cache.

Abstract: Documents are assigned to one or more indexes in a document indexing system on the basis of document properties such as total number of tokens in the document, number of numeric tokens in the document, number of alphabetic tokens in the document, size of the document, and metadata associated with the document. Based on statistical distributions of document properties (over a large number of documents), different indexes can be defined, and a document router can direct a particular document to one index or another based on the properties of the particular document. In some implementations, certain document properties may be used to identify a nonrelevant document, or garbage document, so that it is either not indexed or assigned to an index dedicated for such documents.

Abstract: String matching is a ubiquitous problem that arises in a wide range of applications in computer science, e.g., packet routing, intrusion detection, web querying, and genome analysis. Due to its importance, dozens of algorithms and several data structures have been developed over the years. A recent breakthrough in this field is the FM-index, a data structure that synergistically combines the Burrows-Wheeler transform and the suffix array. In software, the FM-index allows searching (exact and approximate) in times comparable to the fastest known indices for large texts (suffix trees and suffix arrays), but has the additional advantage to be much more space-efficient than those indices. This disclosure discusses an FPGA-based hardware implementation of the FM-index for exact and approximate pattern matching.

Abstract: Methods and apparatus to classify text communications are disclosed. An example method includes determining a first conditional probability of a first feature occurring in a text given that the text belongs to a classification mode, wherein the first feature is included in the text, determining a second conditional probability of a second feature occurring in a text given that the text belongs to the classification mode, wherein the second feature is included in the text, determining a probability of the classification mode occurring, multiplying the first conditional probability, the second conditional probability and the probability of the classification mode to determine a product, and storing the product in a tangible memory as a score that the message belongs to the first classification mode.

Abstract: A method and apparatus for utilizing user behavior to immediately modify sets of search results so that the most relevant documents are moved to the top. In one embodiment of the invention, behavior data, which can come from virtually any activity, is used to infer the user's intent. The updated inferred implicit user model is then exploited immediately by re-ranking the set of matched documents to best reflect the information need of the user. The system updates the user model and immediately re-ranks documents at every opportunity in order to constantly provide the most optimal results. In another embodiment, the system determines, based on the similarity of results sets, if the current query belongs in the same information session as one or more previous queries. If so, the current query is expanded with additional keywords in order to improve the targeting of the results.

Abstract: Tools and techniques for indexing and querying data stores using concatenated terms are provided. These tools may receive input queries that include at least two query terms. The query terms are correlated respectively with fields contained within records within a data store, with these fields being populated with respective field values. The query terms are arranged according to an indexing priority according to which the fields are ranked within an indexing table, which is associated with the data store. The tools then concatenate the query terms as arranged according to the indexing priority. In turn, the tools search the index table for any entries that are responsive to the concatenated query terms.

Abstract: Computer searchable annotated formatted documents are produced by correlating documents stored as a photographic or scanned graphic representations of an actual document (evidence, report, court order, etc.) with textual version of the same documents. A produced document will provide additional details in a computer data structure that supports citation annotation as well as other types of analysis of a document. The computer data structure also supports generation of citation reports and corpus reports. A computer method of creating searchable annotated formatted documents including citation and corpus reports by correlating and correcting text files with photographic or scanned graphic of the original documents. Data structures for correlating and correcting text files with graphic images. Generation of citation reports, concordance reports, and corpus reports. Data structures for citation reports, concordance reports, and corpus reports generation.

Abstract: A search device is provided that extracts and stores field data from document data and displays a search result in a two-dimensional coordinate system whose axes are freely chosen by a user. The search device has a data input unit for inputting input data to the search device, a field extraction unit for extracting field data from the input data, a data storage unit for storing the field data and the input data associated with the field data, a search word input unit for inputting a search word, a search processing unit for searching the field data in the data storage unit based on the inputted search word and for retrieving the input data associated with the found field data, and a display unit for displaying an icon, representing the input data found by the search processing unit, at a position in a coordinate system.

Abstract: Update processing and the like of an index file relating to change of a hierarchical structure is performed. The index file is recorded in a recording medium with content files. The index file is generated based on attribute information of content files and folders including the content files. Content files and folders form a hierarchical structure in which the folders are in an upper hierarchy. In the index file, a prescribed number of entries (management information areas) corresponding to content files and folders, respectively, are provided. Second index information indicating second entries corresponding to folders or content files positioned in a lower hierarchy of folders in the upper hierarchy is provided at first entries corresponding to folders in the upper hierarchy in a list format. First index information indicating the first entries is provided at the second entries.

Abstract: Systems, methods embodied on computer-readable media, and other embodiments associated with index entry eviction are described. One example method includes selecting an index entry for eviction from a bucket of index entries based on a time value, a utility value, and a precedence value. A precedence value may be a value associated with an index entry that is static over time. Additionally, results of a function that compares two precedence values may be static over time. The example method may also include providing an index entry identifier that identifies the index entry.

Abstract: A concurrent grouping operation for execution on a multiple core processor is provided. The grouping operation is provided with a sequence or set of elements. In one phase, each worker receives a partition of a sequence of elements to be grouped. The elements of each partition are arranged into a data structure, which includes one or more keys where each key corresponds to a value list of one or more of the received elements associated with that key. In another phase, the data structures created by each worker are merged so that the keys and corresponding elements for the entire sequence of elements exist in one data structure. Recursive merging can be completed in a constant time, which is not proportional to the length of the sequence.

Abstract: Methods and apparatus to classify text communications are disclosed. An example method includes determining a first conditional probability of a first feature occurring in a text given that the text belongs to a classification mode, wherein the first feature is included in the text, determining a second conditional probability of a second feature occurring in a text given that the text belongs to the classification mode, wherein the second feature is included in the text, determining a probability of the classification mode occurring, multiplying the first conditional probability, the second conditional probability and the probability of the classification mode to determine a product, and storing the product in a tangible memory as a score that the message belongs to the first classification mode.

Abstract: A method for booting up a mobile phone quickly is disclosed. The method includes the steps of: driving hardware devices when the mobile phone is turned on; initializing application software installed in the mobile phone; loading data in the mobile phone from a storage to a memory; creating a table for each kind of data in the memory, and ordering data in each table according to a particular order condition; converting each table into a binary file, and storing the binary file in the storage; loading the binary file of each table directly from the storage to the memory when the mobile phone is turned on. A related quickly booting mobile phone is also disclosed.