Abstract: A method of optimizing a query is provided herein. The method includes determining a cost estimate for a query. The method further includes determining a budget for optimizing the query based on the cost estimate. Additionally, the method includes determining a complexity of the query based on the budget. The method also includes determining a strategy based on the complexity. The strategy specifies a limit to a search space enumerated during optimization of the query. Further, the method includes optimizing the query based on the strategy.

Abstract: Applying screening information to search results is disclosed, including: receiving a search request for products, wherein the search request comprises one or more search conditions and a set of user information; retrieving screening information associated with the set of user information, wherein the screening information indicates one or both of seller information and product information to exclude from search results; determining a plurality of search results based at least in part on the one or more search conditions and determining a search result from the plurality of search results to be excluded based at least in part on the screening information; and returning one or more search results from the plurality of search results other than the search result determined to be excluded.

Abstract: A method of managing a database system that receives N number of requests from one or more nodes in the database system. The N requests are combined before initiating operations to attend to the requests. The number of operations to attend to the requests is reduced and this reduced number of operations is executed.

Abstract: Disclosed are an apparatus and a method for searching a PLC data log. The apparatus for searching for a PLC data log, includes: a data log module operating a linear characteristic for data search based on at least one data search parameter, calculating an index value or a time data value using the operated linear characteristic, and searching for data using at least one of the calculated index value or the calculated time data value; an interface unit receiving a search request signal and at least one parameter for data search and outputting the data searched from the data log module; and a memory unit storing the data and the parameter input or output through the interface unit.

Abstract: Data of a columnar database is organized into extents. Each extent occupies contiguous storage on the disk. An extent stores database blocks of a column of a database table. The database system adds new database blocks of a column to the extents assigned to that column. When a request for adding a block to a table is received, the extent for the table and column combination is obtained and the block added to the extent. Prefetching strategies are used to retrieve database blocks in advance of an actual request. The rate of prefetching is determined per column. The rate of prefetching is adjusted based on the number of faults encountered for the column. Database blocks no longer needed in memory are pushed out. When a scan process is reading blocks, as soon as the block has been processed it is scheduled to be pushed out.

Abstract: A system and method for determining a rank aggregation from a series of partial preferences is presented. A distribution is learned over preferences from partial preferences with sparse support. A computer receives a plurality of partial preferences selected from two or more preference lists. Weights are assigned to each of said plurality of partial preferences, resulting in multiple ranked lists.

Abstract: Data of a columnar database is organized into extents. Each extent occupies contiguous storage on the disk. An extent stores database blocks of a column of a database table. The database system adds new database blocks of a column to the extents assigned to that column. When a request for adding a block to a table is received, the extent for the table and column combination is obtained and the block added to the extent. Prefetching strategies are used to retrieve database blocks in advance of an actual request. The rate of prefetching is determined per column. The rate of prefetching is adjusted based on the number of faults encountered for the column. Database blocks no longer needed in memory are pushed out. When a scan process is reading blocks, as soon as the block has been processed it is scheduled to be pushed out.

Abstract: An enterprise locking service coordinates multiple cooperating applications to ensure that one and only one user is modifying a database record at a given time. The database records may be stored in multiple databases having potentially different database record locking protocols. Through monitoring and tracking requests for database locks, the enterprise locking service is also able to determine database usage trends under various metrics.

Abstract: Methods, and systems, including computer programs encoded on computer-readable storage mediums, including a method for providing a search display environment on an online resource in response to an indication that a search operation is to be performed using a content object selected from the online resource. The method includes displaying an online resource; receiving a first selection indication that one of the content objects has been selected; receiving a second selection indication that a search operation using the selected content object is to be performed; in response to receiving the second selection indication: displaying a search display environment on the online resource, the display of the online resource being subordinate to the display of the search display environment; receiving search results responsive to the search operation; and displaying the search results in the search display environment.

Abstract: This disclosure relates to facilitating the association of structured content in a structured document with unstructured content in an unstructured document. The system described herein may be configured to facilitate the association by linking numeric instances in the structured document to corresponding numeric instances in the unstructured document. In some implementations, the system may be configured to link the numeric instances in the structured document to the corresponding numeric instances the unstructured document based on a uniqueness of the numeric instances in the structured document, structural information assigned to non-unique numeric instances, structural information assigned to unique numeric instances related to the non-unique numeric instances, unstructured contextual information related to non-unique numeric instances, and/or other information.

Abstract: Methods and systems for recommending social networking connections are disclosed. Information is received from a mobile device relating to software applications that are installed on a first user's mobile device. A weight for each software application is calculated based on usage information and each software application is designated to at least one category. A priority is calculated for each category based at least in part on respective weights of software applications designated to the category. A second user, who is not connected to the first user, is detected, wherein the second user has a predetermined number of categories that are the same as the first user's categories, and wherein priorities corresponding to the second user's categories are within a predetermined range of priorities corresponding to the first user's categories. A recommendation to connect with the second user is provided to the first user.

Abstract: A system for providing answers to questions presented in the form of electronic signals representing natural language words conveyed to said system by way of a network connected to a computer. The system includes a plurality of search indexes relating to a field of knowledge, each in a specific natural language. A store-house of natural words is associated with each one of the search indexes, and in which a list of natural words is maintained in an order reflecting the usage frequency of said words in that list. In addition, a language storehouse of natural words common to each of the search indexes associated each with a specific natural language. The search index includes a list of score ordered keywords, indexed answer items each associated with an internal list of references (ILOR) pointing to it, and a list of ordered numerical references associated with each of the ordered keywords. Each such reference represents quantitatively an association between the keyword and an indexed answer item.

Abstract: The present invention includes methods, circuits, systems and corresponding executable code for locating and managing data files/objects such as image files, audio files, etc. According to some embodiments of the present invention, there may be provided a Dynamic Search and Linking Module (DSLM), which DSLM may be functionally associated with an Uploader (an application or module adapted to upload files) of an application or of an operating system. The DSLM may provide an Uploader with search engine querying (e.g. web searching) and search engine result (e.g results of a web search) linking functionality.

Abstract: A hierarchical object is exported from a first electronic system to a second electronic system, where the hierarchical object is modifiable at each of the first and second electronic systems, and where a baseline version of the hierarchical object is created. A first version of the hierarchical object at the first electronic system is compared against the baseline version, to form a first data structure identifying any changes between the first version of the hierarchical object and the baseline version. A second data structure is received identifying changes between a second version of the hierarchical object at the second electronic system and the baseline version. A visualization based on the first and second data structures is provided.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for triggering rich results in response to publication queries. In one aspect, a method includes receiving a publication query. One or more publication search results are obtained. A rich result is triggered based on a score of the first-ranked publication result if it meets a threshold relative to other publication search results. The rich result is populated with additional metadata about the publication obtained from web resources and product resources from multiple corpora. The rich result is provided with the publication search results.

Abstract: A computer-implemented method, system, and computer program product for processing special attributes within a file are provided. The method includes accessing the file with a hierarchical tree structure of file elements, and retrieving special attributes associated with the file elements. The special attributes are selectively assigned to the file elements. The method also includes interpreting the special attributes using hierarchical inheritance to pass the special attributes from subordinate file elements to higher-level file elements. The method further includes creating a file-level representation of the interpreted special attributes.

Abstract: In one embodiment, a method comprises identifying prefix groups for searchable character symbols, each prefix group having a corresponding searchable character symbol comprising at least one searchable character; assigning at least one prefix group to each of a plurality of distributed hash table nodes in a network, each distributed hash table node containing at least one of the prefix groups, each distributed hash table node assigned a corresponding prescribed keyspace range of a prescribed keyspace, each distributed hash table node configured for storing data records having respective primary data record keys within the corresponding prescribed keyspace range; and assigning secondary indexes that start with one of the searchable character symbols to the corresponding prefix group in the associated distributed hash table node, enabling any prefix search starting with the one searchable character symbol to be directed to the corresponding prefix group in the associated distributed hash table node.

Abstract: The present invention extends to methods, systems, and computer program products for managing object lifetime in a cyclic graph. Embodiments of the invention include reclaiming allocated system resources, for example, from a graph of objects that mixes different resource reclamation techniques (such as reference counting and garbage collection). In response to determining that garbage collection is to be performed, references between GC objects and Ref. Counted objects are detected. A reference type (e.g., direct, indirect, standard, tracked, weakened, etc.) for any detected references is also determined. Garbage collection is performed to determine if any allocated system resources can be reclaimed. Garbage collection considers references and references types between GC objects and Ref. Counted objects when determining if objects are to be reclaimed.

Abstract: An approach for conversion between database formats (e.g., from a relational database format to a hash table or a “big table” database format) based on user data access patterns in a networked computing environment is provided. A first set of database tables having a first format is identified based on a set of access patterns stored in a computer storage device. A second set of database tables having a second database format corresponding to the first set of database tables may then be provided (e.g., accessed, augmented, and/or generated). A mapping between the first set of database tables and the second set of database tables may then be created. A column set may then be generated based on at least one condition of the set of queries. The column set may then be used as a key for the second set of database tables.

Abstract: The subject disclosure is directed towards an object (e.g., an aspected vector, queue, map, stack and so forth) container having an exclusive interface, a shared-read-only interface and a shared-write (and read) interface to a common set of data. Use cases during runtime determine the appropriate interface to use. No locking is needed with methods of the exclusive interface or the read-only interface. The shared-write interface is configured to have only concurrency safe methods. Also described is blocking the use of other interfaces while one interface is in use, and the use of reference counter tracking to know when no concurrent readers and/or writers remain, to allow transitioning to use a different interface.