Based On Index Optimization Patents (Class 707/715)
-
Patent number: 9418298Abstract: Systems and methods for enabling the download of a set of media files with a specific order and specific contents and, more particularly, to enabling a download manager to automatically receive the information it requires to retrieve those elements required to replicate a streaming edit through local playback after the downloads complete.Type: GrantFiled: June 11, 2015Date of Patent: August 16, 2016Assignee: SYNERGY SPORTS TECHNOLOGY, LLCInventors: Nils B Lahr, Garrick C Barr
-
Patent number: 9378243Abstract: A system may include a storage device configured to store a data store comprising data. The database system may further include a processor in communication with the storage device. The processor may receive a query that includes at least one predicate associated with the data. The processor may further determine that the at least one predicate is eligible to be converted to a range set predicate. The processor may further convert the at least one predicate to a range set predicate. The processor may further process the query with the range set predicate. A method and computer-readable medium may also be implemented.Type: GrantFiled: December 20, 2013Date of Patent: June 28, 2016Assignee: Teradata US, Inc.Inventors: Rama K. Korlapati, Haiyan Chen, Tri Minh Tran
-
Patent number: 9361304Abstract: Embodiments of the invention relate to systems, methods, and computer program products for automated data purge in an e-discovery system. The automated data purge process determines files within an e-discovery file system that qualify for purging based on one or more purge policies, locates the files within the file system and automatically purges the data from the file system. Additional embodiments provide for automatically creating log entries that track the details of the purge and automatically generating and communicating alerts/messages that notify concerned parties of the data purge. As such the present invention is able to accurately and automatically purge data from an electronic discovery file system and provide for detailed purge data tracking, as well as, purge notification.Type: GrantFiled: May 23, 2013Date of Patent: June 7, 2016Assignee: BANK OF AMERICA CORPORATIONInventors: Eric B. Hobart, John N. Whalen, Michael J. Richardson, Kellie H. Hudson
-
Patent number: 9311411Abstract: Techniques are described herein for processing social search results. Such social search results may be included in a relatively higher-ranked (e.g., a highest-ranked) subset of a user's search results and/or selected from a relatively lower-ranked subset of the user's search results in response to a determination that the relatively higher-ranked subset includes social search result(s). In one example, the social search results (or a subset thereof) may be annotated to include publicly available rich metadata. Such metadata may be extracted from user profiles on social networking domains from which the social search results are received. In another example, the social search results (or a subset thereof) may be clustered such that they are consecutively ranked. In yet another example, the social search results (or a subset thereof) may be configured to be displayed in a designated arrangement (e.g., in a grid having multiple columns).Type: GrantFiled: August 25, 2011Date of Patent: April 12, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Sanaz Ahari, Timothy C. Hoad, Deepak Vijaywargi, Yatharth Saraf
-
Patent number: 9292554Abstract: A method of indexing a database column is disclosed. A permutation function f is determined. A shortcut that connects two non-adjacent elements of a permutation cycle based on f is created. A traversal of the permutation cycle without the shortcut comprises starting at a first element of the permutation cycle by updating a candidate row number to an initial value, wherein the initial value comprises a value stored in the database column. Traversing through one element of the permutation cycle comprises reading a row value in the database column using the candidate row number and then updating the candidate row number with function f of the most recently read row value. The step of traversing through one element of the permutation cycle is repeated until the most recently read row value is equal to the initial value. Creating the shortcut comprises storing a relation between the two non-adjacent elements.Type: GrantFiled: August 20, 2013Date of Patent: March 22, 2016Assignee: Pivotal Software, Inc.Inventor: Michael Brand
-
Patent number: 9177019Abstract: A computer system including a database having a database table for storing records including first columns for storing data values, and at least one second column for storing keys identifying records stored in the database. The computer system also including a set of index tables with each having assigned thereto an index table identifier, an arrangement for receiving a query an arrangement for storing a predefined ordered sequence of index table identifiers, and an arrangement for processing the query by checking each one of the index tables for being relevant for the execution of the query, storing the index table identifier for each relevant index table in a query execution table, sorting the query execution table in accordance with the predefined ordered sequence, and executing the query using the index tables identified in the query execution table in the order given by the sorting of the query execution table.Type: GrantFiled: May 19, 2009Date of Patent: November 3, 2015Assignee: SAP SEInventor: Matthias Aurin
-
Patent number: 9177079Abstract: A computer readable storage medium includes executable instructions to receive a request for data from a multi-dimensional cube divided into partitions distributed across nodes supporting a shared nothing distributed multi-dimensional database. The request is transformed into physical access layer operators in a tree structure. The tree structure is reduced into an index scan operator.Type: GrantFiled: January 22, 2010Date of Patent: November 3, 2015Assignee: JOVIANDATA, INC.Inventors: Satya Ramachandran, Anupam Singh, Parveen Jain, Sushil Thomas
-
Patent number: 9141670Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system.Type: GrantFiled: June 29, 2011Date of Patent: September 22, 2015Assignee: Teradata US, Inc.Inventors: Jeremy L. Branscome, Michael Paul Corwin, Joseph Irawan Chamdani, Rajasekhar Cherabuddi
-
Patent number: 9043311Abstract: Systems and methods are provided for efficiently indexing archived objects in an archive data store to allow for efficient and quick access to the archived objects. The systems and methods provided also allow alleviate the strain on a live data store and enable a requester wishing to retrieve updates to do so without knowledge of the location of the stored update on a live or archive data store.Type: GrantFiled: October 20, 2011Date of Patent: May 26, 2015Assignee: Amazon Technologies, Inc.Inventors: Almann T. Goo, Michael J. McInerny
-
Patent number: 9037569Abstract: A method of identifying one or more particular images from an image collection, includes indexing the image collection to provide image descriptors for each image in the image collection such that each image is described by one or more of the image descriptors; receiving a query from a user specifying at least one keyword for an image search; and using the keyword(s) to search a second collection of tagged images to identify co-occurrence keywords. The method further includes using the identified co-occurrence keywords to provide an expanded list of keywords; using the expanded list of keywords to search the image descriptors to identify a set of candidate images satisfying the keywords; grouping the set of candidate images according to at least one of the image descriptors, and selecting one or more representative images from each grouping; and displaying the representative images to the user.Type: GrantFiled: November 14, 2013Date of Patent: May 19, 2015Assignee: Kodak Alaris Inc.Inventors: Mark D. Wood, Alexander C. Loui
-
Patent number: 9020969Abstract: Various embodiments of systems and methods for tracking queries and retrieved results are described herein. In one aspect, a first query is associated with a first result set in a first tuple and a second query is associated with a second result set in a second tuple. The first result set is retrieved based on the execution of the first query and the second result set is retrieved based on the execution of the second query. The first and the second tuples are retained in a data structure in the order of execution of the respective queries. The retrieved result sets may be accessed forwards or backwards along the data structure without re-execution of the queries.Type: GrantFiled: July 13, 2011Date of Patent: April 28, 2015Assignee: SAP SEInventors: Gerd Forstmann, Stephan Muench
-
Patent number: 9015143Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for refining search results. In one aspect, a method includes presenting search results that are responsive to a search query on a search engine results page and each search result includes a snippet. The method also include receiving a refinement to the search query through the search engine results page and generating a request to update one or more of the snippets based on the refinement. The method also includes receiving one or more updated snippets in response to the request and updating one or more of the search results presented on the search engine results page using the one or more updated snippets.Type: GrantFiled: August 10, 2011Date of Patent: April 21, 2015Assignee: Google Inc.Inventors: Engin Cinar Sahin, Daniel A. De M. Rocha, Richard C. Wang
-
Patent number: 9009105Abstract: The subject matter described herein relates to software routines called application exits that are provided at well defined phases of a tenant copy process. The tenant copy process enables copying of separated tenant data associated with a source tenant at multi-computing tenant system to a new created tenant at a destination location either at multi-computing tenant computing system or second multi-computing tenant computing system. The application exits perform predefined functions at the well defined phases such that the predefined functions enable operations including detachment of tenant data from the source tenant that needs to be copied or moved such that the detached tenant data is separated tenant data. When the source tenant is just being moved, instead of being copied, from a source location to a destination location, the source tenant is deleted once all the data associated with the source tenant has been moved to the destination location.Type: GrantFiled: December 30, 2010Date of Patent: April 14, 2015Assignee: SAP SEInventors: Martin Hartig, Peter Eberlein, Holger Neu, Hai Anh Pham
-
Patent number: 9009135Abstract: A server receives a search request in a third format. The third format is a search request format. A first search query in a first format is generated. The first format is a first search query format. A second search query is generated in a second format. The second format is compatible with a format used by a second search engine. The second format is a second search query format. The search request is in the third format. The first format and the second format are different from one another. First result data comprising a plurality of first result data items, and second result data comprising a plurality of second result data items are received. A search result is generated. The generating the search result includes consolidating the plurality of the first result data items and the plurality of the second result data items.Type: GrantFiled: January 29, 2010Date of Patent: April 14, 2015Assignee: Oracle International CorporationInventors: Hari Krishna Gutlapalli, Ashish Joshi, Hema Bharadwaj
-
Patent number: 9002823Abstract: Systems and methods according to embodiments provide elasticity for complex event processing (CEP) systems. Embodiments may comprise at least the following three components: (1) incremental query optimization, (2) operator placement, and (3) cost explanation. Incremental query optimization allows avoiding simultaneous computation of identical results by performing operator-level query reuse and subsumption. Using automatic operator placement, a centralized CEP engine can be transformed into a distributed one by dynamically distributing and adjusting the execution according to unpredictable changes in data and query load. Cost explanation functionality can provide end users with near real-time insight into the monetary cost of the whole system, down to operator level granularity. Combination of these components allows a CEP system to be scaled up and down.Type: GrantFiled: June 28, 2012Date of Patent: April 7, 2015Assignee: SAP SEInventors: Zbigniew Jerzak, Thomas Heinze, Yuanzhen Ji
-
Patent number: 9002822Abstract: A cost monitoring system can monitor a cost of queries executing in a complex event processing system, running on top of a pay-as-you-go cloud infrastructure. Certain embodiments may employ a generic, cloud-platform independent cost model, multi-query optimization, cost calculation, and/or operator placement techniques, in order to monitor and explain query cost down to an operator level. Certain embodiments may monitor costs in near real-time, as they are created. Embodiments may function independent of an underlying complex event processing system and the underlying cloud platform. Embodiments can optimize a work plan of the cloud-based system so as to minimize cost for the end user, matching the cost model of the underlying cloud platform.Type: GrantFiled: June 21, 2012Date of Patent: April 7, 2015Assignee: SAP SEInventors: Zbigniew Jerzak, Thomas Heinze, Yuanzhen Ji
-
Patent number: 8996463Abstract: Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations.Type: GrantFiled: March 11, 2013Date of Patent: March 31, 2015Assignee: MongoDB, Inc.Inventors: Dwight Merriman, Eliot Horowitz, Chris Todd Westin
-
Publication number: 20150081667Abstract: A method of analyzing the performance of a query optimizer includes identifying an event trigger. A reproduction object characterizing operational parameters of the customer computer at the time of the event trigger is populated. The reproduction object is transported from the customer computer to a test computer. The reproduction object is analyzed at the test computer to characterize the performance of a query optimizer.Type: ApplicationFiled: August 22, 2014Publication date: March 19, 2015Inventors: Brian Hagenbuch, Sivaramakrishnan Narayanan, Chad William Whipkey, Florian Michael Waas
-
Patent number: 8983929Abstract: Methods and systems for managing an index database. In one exemplary method, an index database is stored on a machine readable volume with an operating system and the files which have been indexed, and then the volume is, after the storing, made available for distribution to licensees or customers. In this manner, the volume will include a previously created index database, allowing a user to begin use of the index database without having to perform an indexing operation.Type: GrantFiled: March 13, 2012Date of Patent: March 17, 2015Assignee: Apple Inc.Inventors: Andrew Carol, Yan Arrouye, Dominic Giampaolo
-
Patent number: 8983931Abstract: Systems, methods, and computer program product embodiments are provided for path-based query evaluation. The embodiments include representing a markup language document as a descriptive catalog, and capturing relationships in the descriptive catalog as an index summary. The index summary is utilized for evaluating a path-based query.Type: GrantFiled: November 29, 2011Date of Patent: March 17, 2015Assignee: Sybase, Inc.Inventor: Mohyuddin Rehmattullah
-
Patent number: 8983930Abstract: Systems and methods are disclosed herein for providing search results, particularly product records from a product database. Products records have facet groups associated therewith and facet groups have probabilities associated therewith indicating the usefulness of the facet group as a way of organizing or filtering search results. For a query, relevant product records are identified. For facet groups present among the relevant product records entropy values are calculated based on a distribution of values for the attribute defining the facet group. The entropy value increases as the distribution of values becomes more uniform. The facet group probability and entropy value are combined to assign a score to the facet groups. The facet groups are ranked and selected according to the score and search results are presented with indicators of the facet groups to enable a user to manage the search results.Type: GrantFiled: March 11, 2013Date of Patent: March 17, 2015Assignee: Wal-Mart Stores, Inc.Inventors: Jinxing Cheng, Abhishek Gattani
-
Publication number: 20150066899Abstract: A search index structure which extends a typical composite index by incorporating an index which is optimized for fast retrieval from storage and which eliminates data which is specific to phrase searching. Other data is represented in a manner which allows it to be calculated rather than stored. Associating variable length entries with logical categories allows their length to be inferred from the category rather than stored. Using delta values between document IDs rather than the ID itself generates a compact, dense symbol set which is efficiently compressed by Huffman encoding or a similar compression method. Using an upper threshold to remove large, and thus rare, delta values from the symbol set prior to encoding further improves the encoding performance.Type: ApplicationFiled: November 6, 2014Publication date: March 5, 2015Applicant: Microsoft CorporationInventors: Chadd Creighton Merrigan, Mihai Petriuc, Raif Khassanov, Artsiom Ivanovich Kokhan
-
Patent number: 8972378Abstract: The present invention extends to methods, systems, and computer program products for formulating global statistics for parallel databases. In general, embodiments of the invention merge (combine) information in multiple compute node level histograms to create a global histogram for a table that is distributed across a number of compute nodes. Merging can include aligning histogram step boundaries across the compute node histograms. Merging can include aggregating histogram step-level information, such as, for example, equality rows and average range rows (or alternately equality rows, range rows, and distinct range rows), across the compute node histograms into a single global step. Merging can account for distinct values that do not appear at one or more compute nodes as well as distinct values that are counted at multiple compute nodes. A resulting global histogram can be coalesced to reduce the step count.Type: GrantFiled: October 22, 2012Date of Patent: March 3, 2015Assignee: Microsoft CorporationInventors: Alan Dale Halverson, Eric R. Robinson, Srinath Shankar, Jeffrey F. Naughton
-
Patent number: 8972382Abstract: Generally described, embodiments of the present invention provide the ability to generate a universal query result set from several different search index result sets by including identifications of items from the different search index result sets in an accurate manner. After a query has been submitted, search index result sets are received from several different search indexes, an allocation score for each search index is computed and a universal item score for the top-level item identified in each search index is computed. The method then combines the allocation score and the universal item score for the top level item for each search index result set and adds the item with the highest combined score to the universal query result set.Type: GrantFiled: July 2, 2013Date of Patent: March 3, 2015Assignee: A9.com, Inc.Inventors: Heath W. Hohwald, Yu Shan Fung
-
Patent number: 8959080Abstract: Techniques for performing searches using models generated from data mining. These techniques may include receiving a query including a search string. If a portion of the search string matches with a category of relationship data, the portion of the search string may be replaced with a label of the category to generate a modified query. Based on the modified query and models generated from mining historical search data, intent of the query may be determined, and searches may be then performed.Type: GrantFiled: November 14, 2012Date of Patent: February 17, 2015Assignee: Alibaba Group Holding LimitedInventors: Hao Lang, Chao Tang, Xiaoxun Zhang, GuiRong Xue
-
Patent number: 8959079Abstract: A method and system for providing relationships in search results are provided. The method includes indexing an entity in a search index as an entity index entry, the entity index entry including facets providing information on the entity type and related entities. Search results are obtained by a search engine in the form of ranked result entities, wherein the result entities include multiple types of entities. The method then includes retrieving index entries to determine relationships between search result entities and providing the relationships in search results. The method further includes, for each result entity, retrieving its entity index entry and cross-checking the facets of the retrieved entity index entry for other result entities.Type: GrantFiled: September 29, 2009Date of Patent: February 17, 2015Assignee: International Business Machines CorporationInventors: Inbal Ronen, Erel Uziel, Sivan Yogev, Naama Zwerdling
-
Patent number: 8935233Abstract: A database table is provided. The database table includes several column tuples. A column is selected in the database table. The column tuples of the selected column are partitioned into several bins. Each bin includes a range of tuples and associated metadata. The associated metadata includes at least one of: a minimum tuple value for the tuples in the bin, a maximum tuple value for the tuples in the bin, a minimum tuple identifier for the bin and a maximum tuple identifier for the bin. The bins are sorted based on the tuple values to provide an approximate index for the database.Type: GrantFiled: September 28, 2010Date of Patent: January 13, 2015Assignee: International Business Machines CorporationInventors: Vatsalya Agrawal, Vivek Bhaskar, Ahmed Shareef
-
Patent number: 8918382Abstract: This disclosure relates to learning common spelling errors of metadata terms associated with content through content matching, such as content matching using fingerprints.Type: GrantFiled: May 8, 2013Date of Patent: December 23, 2014Assignee: Google Inc.Inventors: Matthew Sharifi, Gheorghe Postelnicu
-
Patent number: 8918388Abstract: A method and apparatus for a data warehouse built on top of MapReduce is provided. A virtual view is defined on top of the common star or snowflake data warehouse schema. A SQL-like, but much more succinct, query language is provided to leverage the virtual view. Many advanced query processing features leveraging the virtual view are also provided. Further, several optimization techniques ranging from data compression and access method to multi-query optimization and exploiting materialized views are provided. Further, a technique to seamlessly integrate the data warehouse system into any ad-hoc MapReduce jobs is provided. Thus, fully leveraging the power of both MapReduce and data warehouse technologies is achieved.Type: GrantFiled: March 31, 2010Date of Patent: December 23, 2014Assignee: Turn Inc.Inventor: Songting Chen
-
Publication number: 20140372408Abstract: Prior to query execution a compressed table and compressed RDF data are created by use of: RDF data stored in an external storage device; and a compression reference table entered from an input device. The compression reference table is used to create a compressed query from an original query entered from the input device, and the compressed RDF data is searched to generate a variable biding table. An expanded query having a node added thereto is next created by use of the original query and the variable binding table, the node restricting a variable value range. The expanded query and the original RDF data are used to generate a query execution result at last.Type: ApplicationFiled: January 25, 2012Publication date: December 18, 2014Inventor: Eiichiro Chishiro
-
Patent number: 8914352Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.Type: GrantFiled: July 10, 2007Date of Patent: December 16, 2014Assignee: Teradata US, Inc.Inventors: Michael Chaves, Kasturi Belur, Scott Shelton, Henry Fu
-
Patent number: 8914356Abstract: Techniques for indexing file paths of items in a content repository may include taking turns in querying each different item type or folder type in a round robin schedule to visit select nodes of the folder tree of that type to update and maintain the file path indexes. Item types or folder types may be associated with a count of instances or children of instances that are missing indexes. For each item type or folder type, a query may be performed for instances of the item type or folder type having children that are missing indexes, the instances or children of the instances returned may be associated with file path indexes, and the count of instances or children of instances may be adjusted based on the associating.Type: GrantFiled: November 1, 2012Date of Patent: December 16, 2014Assignee: International Business Machines CorporationInventor: David B. Victor
-
Patent number: 8914354Abstract: A method for estimating the selectivity of a database base table predicate, the cardinality of a join, and the cardinality of an aggregation. The method includes receiving a database query, the query comprising one or more query predicates and referencing one or more database tables. One or more join indexes are identified, the join index(es) defined on respective database tables referenced by the database query. The join index(es) comprises one or more join index predicates, and includes one or more join columns in its select list. The row count selected by the query predicates is calculated at least partly using the row count or statistics of the one or more join indexes. The selectivity of the base table predicate is calculated at least partly from the calculated row count. The cardinality of the join is estimated at least partly from the row count and statistics of the identified join index(es).Type: GrantFiled: July 28, 2009Date of Patent: December 16, 2014Assignee: Teradata US, Inc.Inventors: Grace Au, Rama Krishna Korlapati, Haiyan Chen
-
Patent number: 8909663Abstract: A method, system and computer program product are disclosed for searching for data. In one embodiment, the invention provides a method comprising identifying a query and a search scope including a set of specified entities; and for each of these entities, estimating a number of documents that would be identified in a search through the entity to answer the query. On the basis of this estimating, a subset of the entities is formed. The query and this subset of entities are sent to a search engine to search the subset of entities to answer the query. In one embodiment, the estimating includes collecting statistical information from queries to build up a historical cache using heuristics or machine learning techniques, wherein the query includes a key word and a scope, and the historical cache contains a maximum number of returned results for an entity given the queries executed.Type: GrantFiled: March 30, 2012Date of Patent: December 9, 2014Assignee: International Business Machines CorporationInventors: Yu Deng, Murthy V. Devarakonda, Rafah A. Hosn, Nithya Rajamani, Norbert G. Vogl
-
Patent number: 8909615Abstract: A search system can maintain a search index of metadata and text for objects in a repository, repositories or distributed across a network. The search index can be divided into partitions with a partition assigned a first capacity utilization threshold and a second capacity utilization threshold. If the capacity utilization of the partition is below the first threshold, the system can add, update and delete information in the partition. If the capacity utilization of the partition is above the first threshold, the system can update and delete information in the partition, but cannot add information for new objects to the partition. If the capacity utilization of the partition is above the second threshold, the system can enter a rebalancing mode in which it seeks to rebalance capacity utilization between partitions. The behavior of the system can change depending upon the size of a partition relative to its configurable thresholds.Type: GrantFiled: August 27, 2012Date of Patent: December 9, 2014Assignee: Open Text S.A.Inventors: Patrick Thomas Sidney Pidduck, Aleksandra Czarlinska
-
Patent number: 8903912Abstract: A method includes, in a server residing in a network of interconnected computers, populating a repository with content, each one of the content categorized by at least one community designation, one topic designation, one tag and/or one company designation, receiving registration information for users, the registration information including a username and at least one community designation, one topic designation, one tag and/or one company designation, receiving content from a first user, the content including at least one community designation, one topic designation, one tag and/or one company designation, storing the received content in the repository, and notifying a subset of users of the received content, the community designation, topic designation, tag and/or company designation of each of the subset of users matching the community designation, topic designation, tag and/or company designation of received content.Type: GrantFiled: May 18, 2012Date of Patent: December 2, 2014Assignee: Dynamic Signal Inc.Inventor: Douglas A. Brown
-
Publication number: 20140351238Abstract: Embodiments of the invention provide systems and methods for searching a repository of information such as a database using a keyword search and/or an attribute search in near real time. According to one embodiment, a method of searching a repository of information can comprise receiving a set of search criteria for performing the search and selectively performing one or more of an attribute search and a keyword search of the information in the repository based on the received search criteria.Type: ApplicationFiled: June 2, 2014Publication date: November 27, 2014Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: YU CONG LAM, PAOLO JUVARA
-
Publication number: 20140351053Abstract: A targeted area audio distribution system for Satellite Digital Audio Radio Services Receivers (“SDARS”) provides specific content to listeners based on location. A service provider can facilitate delivery of local content using a telematics device installed in the listener's vehicle. The telematics device uses a content database indexed on an identifier formed from coordinates of a desired geographical area to target particular content for users in a targeted area as small as a few blocks. In addition, interstate drivers can receive location specific advertisements for exits that they may be approaching. Digital audio content can be queued up for insertion into the audio stream based on specific locations. The identifier can also be used to report vehicle performance information from a plurality of vehicles to facilitate providing real-time traffic conditions for many traffic corridors.Type: ApplicationFiled: August 13, 2014Publication date: November 27, 2014Inventor: Charles M. Link, II
-
Patent number: 8898156Abstract: Systems, methods, and devices are described for retrieving query results based at least in part on a query and one or more similar queries. Upon receiving a query, one or more similar queries may be identified and/or calculated. In one embodiment, the similar queries may be determined based at least in part on click-through data corresponding to previously submitted queries. Information associated with the query and each of the similar queries may be retrieved, ranked, and or combined. The combined query results may then be re-ranked based at least in part on a responsiveness and/or relevance to the previously submitted query. The re-ranked query results may then be output to a user that submitted the original query.Type: GrantFiled: March 3, 2011Date of Patent: November 25, 2014Assignee: Microsoft CorporationInventors: Jun Xu, Hang Li
-
Patent number: 8898139Abstract: Systems and methods for a dynamic visual search engine are provided. In one example method, a criteria used to partition a set of compressed image descriptors into multiple database shards may be determined. Additionally, a size of a dynamic index may be determined. The dynamic index may represent a dynamic number of images and may be configured to accept insertion of reference images into the dynamic index that can be search against immediately. According to the method, an instruction to merge the uncompressed image descriptors of the dynamic index into the database shards of the compressed image descriptors may be received, and the uncompressed image descriptors of the dynamic index may be responsively merged into the database shards of the compressed image descriptors based on the criteria.Type: GrantFiled: June 22, 2012Date of Patent: November 25, 2014Assignee: Google Inc.Inventors: James William Philbin, Anand Pillai, John Flynn, Hartwig Adam
-
Patent number: 8892566Abstract: An index is created for a database by selecting at least one column of a database table as a basis to create the index, generating at least one index of a tree structure according to the at least one column, where a pointer stored in a leaf node of the at least one index is null. In an example embodiment, a value to a pointer is stored in a leaf node according to an intermediate result in response to the intermediate result being generated, where the pointer stored in the leaf node points to a data page storing the intermediate result. The created index can be reused and the intermediate result can be effectively used, such that the efficiency of database operation is improved.Type: GrantFiled: March 28, 2011Date of Patent: November 18, 2014Assignee: International Business Machines CorporationInventors: Qi Chen, Hai Feng Li, Guang Zhou Zhang
-
Patent number: 8880507Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.Type: GrantFiled: October 27, 2010Date of Patent: November 4, 2014Assignee: Brocade Communications Systems, Inc.Inventors: Sridhar Kotha, Satyanarayana Arvapalli, Vikram Bichal, Anil Kumar Gajkela, Srinivas Reddy Bhima reddy, Balajl Tadepalli, Venkatesh Nagapudl, Satsheel Altekar
-
Patent number: 8880506Abstract: A query may be rewritten to leverage information stored in a structured XML index. An operator in the query may be analyzed to determine an input source database object for the operator by traversing an operator tree rooted at the operator. The path expressions associated with the operator tree may be fused together to form an effective path expression for the operator. If the effective path expression directly matches a path expression derived from the index, the query may be rewritten using references to the index. Operators in a query that have effective paths that refer to data in the same index table may be grouped together. A single subquery may be written for a group of operators. Also, a structured XML index may be used as an implied schema for indexed XML data. This implied schema may be used to optimize queries that refer to the indexed XML data.Type: GrantFiled: October 16, 2009Date of Patent: November 4, 2014Assignee: Oracle International CorporationInventors: Hui Joe Chang, Thomas Baby, Zhen Hua Liu
-
Publication number: 20140324822Abstract: A method and system are given for providing a virtual environment spanning a desktop and a cloud. In one example, the method includes receiving a query template over a data set that resides in the cloud, optimizing the query template to segment the query template into an offline phase and an online phase, executing the offline phase on the cloud to build one or more indexes, and sending the one or more indexes to the desktop.Type: ApplicationFiled: July 15, 2014Publication date: October 30, 2014Inventor: Christopher Olston
-
Publication number: 20140324821Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.Type: ApplicationFiled: April 9, 2014Publication date: October 30, 2014Applicant: Teradata CorporationInventors: Krishnan Meiyyappan, Liuxi Yang, Jeremy Branscome, Michael Paul Corwin, Ravindran Krishnamurthy, Kapil Laxmikant Surlaker, James Shau, Joseph Irawan Chamdani
-
Publication number: 20140317086Abstract: Systems and methods are disclosed for efficiently searching a database including a table. The table is partitioned along a first dimension, such as latitude. Indexes in each of the partitions are built along a second dimension, such as longitude. The table may also be clustered according to an index to improve performance. When a processor receives a database query term and a starting location, the processor selects, from the table, a data partition within a first offset to the starting location along the first dimension. The processor selects, from the selected data partition, a first number of first data records related to the query term and within a second offset to the starting location along the second dimension.Type: ApplicationFiled: April 17, 2013Publication date: October 23, 2014Applicant: Yahoo! Inc.Inventor: Rick James
-
Publication number: 20140317087Abstract: In accordance with disclosed embodiments, there are provided systems and methods for implementing and maintaining sampled tables in a database system.Type: ApplicationFiled: April 21, 2014Publication date: October 23, 2014Applicant: salesforce.com, inc.Inventor: Jesse Yarbro Collins
-
Patent number: 8863146Abstract: A method comprising receiving data, where the data includes one or more elements, the data is associated with a first set of indices, and the first set of indices references the one or more elements. The method may further include folding a plurality of indices into a single index, where the single index references the one or more elements of the received data that were referenced by the plurality of indices, the folding generates a second set of indices, and the folding is performed when concurrent process threads are not generated based on the first set of indices. The method may further include determining whether concurrent process threads should be generated based on the second set of indices and generating the concurrent process threads for the second set of indices when the determining determines that the concurrent process threads should be generated based on the second set of indices.Type: GrantFiled: May 13, 2011Date of Patent: October 14, 2014Assignee: The MathWorks, Inc.Inventors: Halldor Narfi Stefansson, Edric Mark Ellis
-
Patent number: 8862458Abstract: The present disclosure involves systems, software, and computer implemented methods for providing a natural language interface for searching a database. One process includes operations for receiving a natural language query. One or more tokens contained in the natural language query are identified. A set of sentences is generated based on the identified tokens, each sentence representing a possible logical interpretation of the natural language query and including a combination of at least one of the identified tokens. At least one sentence in the set of sentences is selected for searching a database based on the identified tokens.Type: GrantFiled: November 30, 2010Date of Patent: October 14, 2014Assignee: SAP AGInventors: Uwe Freising, Marit Rams
-
Patent number: 8849659Abstract: Systems and methods are disclosed to operate a mobile device by capturing user input, transmitting the user input over a wireless channel to an engine, analyzing at the engine a music clip or video in a multimedia stream, and sending an analysis wirelessly to the mobile device.Type: GrantFiled: July 12, 2010Date of Patent: September 30, 2014Assignee: Muse Green Investments LLCInventor: Bao Q. Tran