Based On Access Path Patents (Class 707/716)
  • Patent number: 10223419
    Abstract: The disclosure relates to technology for facilitating query optimization in a distributed data processing system to efficiently and precisely compute predicate push down and partition pruning A query operation is performed to locate data in the data processing system, thereby generating a predicate. Critical points of the predicate are determined based on data stored in the system, and critical point ranges are formed from a sorted sequence of each of the critical points. The predicate is evaluated using the critical points to qualify the critical point ranges, and a reduction is applied to the predicate during partial evaluation to produce reduced predicates on the qualified critical point ranges. The qualified critical point ranges are compared and matched to range partitions of data stored in the distributed system to qualify the range partitions. The reduced predicate is processed against the data in the qualified range partitions to obtain a query result.
    Type: Grant
    Filed: July 16, 2015
    Date of Patent: March 5, 2019
    Assignee: Futurewei Technologies, Inc.
    Inventor: Yan Zhou
  • Patent number: 10114906
    Abstract: The disclosed embodiments provide a system that describes a semi-structured document for the purpose of acquiring a set of data elements from the semi-structured document. During operation, the system obtains a physics model of a semi-structured document, wherein the physics model includes a set of relationships represented by physical objects that describe relative positions of a set of data elements in the semi-structured document. Next, the system applies the physics model to a representation of the semi-structured document to automatically extract a set of data from the representation. The system then provides the extracted set of data for use with one or more applications without requiring manual input of the data into the one or more applications.
    Type: Grant
    Filed: July 31, 2015
    Date of Patent: October 30, 2018
    Assignee: INTUIT INC.
    Inventors: Richard J. Becker, Carolina Simoes Gomes, Daniel L. Moise, Horace Chan
  • Patent number: 10108411
    Abstract: The technology disclosed relates to sub-clustering within service clusters in real-time. In particular, it relates to accessing a network topology that records node data and connection data including processes running on numerous hosts grouped into local services on the hosts, the local services running on multiple hosts grouped into service clusters and sub-clusters of service clusters, and network connections used by the service clusters to connect the hosts grouped into service connections, wherein the node data includes software versions of the processes and process data with configuration files and clustering the multiple hosts with the service clusters into the sub-clusters based at least in part on the software versions.
    Type: Grant
    Filed: October 7, 2016
    Date of Patent: October 23, 2018
    Assignee: Lightbend, Inc.
    Inventors: Abhinav A. Vora, Aiyesha Lowe Ma, Amit Sasturkar, Oliver Kempe, Narayanan Arunachalam, Alan Ngai, Vishal Surana, Omer Emre Velipasaoglu
  • Patent number: 9953065
    Abstract: The invention relates to a computer-implemented method for processing a query in a database, the query comprising a search value. The database comprises a plurality of datasets the datasets comprising entries, wherein distance statistics are assigned to the datasets. The distance statistics describe the minimum and maximum distance between the values of the entries of a dataset of the plurality of datasets and a reference value. The method comprises determining the distance between the search value and the reference value, said determination resulting in a search distance, determining a subset of datasets from the plurality of datasets for which the search distance is within the limits given by the minimum and maximum distances described by the respective distance statistics, and searching for the search value in the subset of datasets.
    Type: Grant
    Filed: February 13, 2015
    Date of Patent: April 24, 2018
    Assignee: International Business Machines Corporation
    Inventors: Lukasz Gaza, Artur M. Gruszecki, Tomasz Kazalski, Konrad K. Skibski, Tomasz Stradomski
  • Patent number: 9922290
    Abstract: A pair of records is tokenized to form a normalized representation of an entity represented by each record. The tokens are correlated to a machine learning system by determining whether a learned resolution already exists for the two entities. If not, the normalized records are compared to generate a comparison measure to determine whether the records match. The normalized records can also be used to perform a web search and web search results can be normalized and used as additional records for matching. When a match is found, the records are updated to indicate that they match, and the match is provided to the machine learning system to update the learned resolutions.
    Type: Grant
    Filed: August 12, 2014
    Date of Patent: March 20, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Satish J. Thomas, Murtaza Muidul Huda Chowdhury
  • Patent number: 9892469
    Abstract: Methods and systems are provided for determining the intent of a recommendation made by a user of a mobile application where the application includes a plurality of separable components, any one or more of which the recommendation can apply to. An application in which a user recommendation control is provided for presentation to a user also includes a tag indicating how a recommendation of the application should be interpreted with respect to the components included therein. The tag can be set by the application developer and can be in the form of text (e.g., a keyword or term) or a uniform resource locator (URL). Where a tag references multiple components of an application, a recommending user can be presented with a recommendation intent query. The recommendation intent query allows a user to designate one or more components of the application to which the user's recommendation should be attributed.
    Type: Grant
    Filed: April 19, 2012
    Date of Patent: February 13, 2018
    Assignee: Google Inc.
    Inventors: Neha Pattan, Jennifer W. Lin
  • Patent number: 9798775
    Abstract: A method and system for forecasting a histogram in a database system is provided. The method includes determining that database table statistics and historical statistical histograms associated with specified subject matter have been previously retrieved. The database table statistics and historical statistical histograms are retrieved and determined to be frequency based histograms. Historical target values associated with the historical statistical histograms are identified and new target values associated with the historical target values are identified. A value identifying a number of occurrences for identified target values comprising the new target values and the historical target values is forecast and database table histograms comprising the identified target values are stored.
    Type: Grant
    Filed: January 16, 2015
    Date of Patent: October 24, 2017
    Assignee: International Business Machines Corporation
    Inventors: Felipe G. Bortoletto, Reinaldo T. Katahira, Craig M. Trim
  • Patent number: 9703833
    Abstract: A system includes reception of a request conforming to a modeled query and join filter criteria, the request comprising a first subrequest associated with a search attribute view and a second subrequest associated with an analytical view, definition of a join between the search attribute view and the analytical view based on one or more view attributes of the search attribute view, and filtering of a result set associated with the first subrequest based on the join and on the join filter criteria.
    Type: Grant
    Filed: November 30, 2012
    Date of Patent: July 11, 2017
    Assignee: SAP SE
    Inventors: Daniel Buchmann, Waldemar Porscha, Marco Pesarese, Frank Michels, Florian Kresser, Christian Münkel
  • Patent number: 9652451
    Abstract: The invention allows end users to obtain immediate, accurate information from structured databases without writing complex database query commands. The invention allows two different, but synchronized, methods of end user information requests: Spoken or typed Natural Language requests, and a Visual Request Specification method. Furthermore, the invention provides a user the means of “teaching the system the correct interpretation” when an information request was misunderstood by the invention's Natural Language Understanding module.
    Type: Grant
    Filed: May 8, 2014
    Date of Patent: May 16, 2017
    Inventor: Marvin Elder
  • Patent number: 9633317
    Abstract: A dynamically evolving cognitive architecture system based on a natural language intent interpreter is described. A system forms an intent based on a user input, and creates a plan based on the intent. The plan includes a first action object that transforms a first concept object associated with the intent into a second concept object and also includes a second action object that transforms the second concept object into a third concept object associated with a goal of the intent. The first action object and the second action object are selected from multiple action objects. The system executes the plan, and outputs a value associated with the third concept object.
    Type: Grant
    Filed: August 18, 2014
    Date of Patent: April 25, 2017
    Assignee: Viv Labs, Inc.
    Inventors: Mark Gabel, Christopher Brigham, Adam Cheyer
  • Patent number: 9619475
    Abstract: A method and an electronic device for determining the reliability of a Uniform Resource Locator (URL) is provided. The method includes receiving a selection of a displayed URL, detecting a reliability of the selected URL, and providing a safety level of the URL based on the detected reliability.
    Type: Grant
    Filed: May 7, 2015
    Date of Patent: April 11, 2017
    Assignee: Samsung Electronics Co., Ltd
    Inventor: Sung-Jae Shin
  • Patent number: 9594542
    Abstract: A dynamically evolving cognitive architecture system based on training by third-party developers is described. A system forms an intent based on a user input, and creates a plan based on the intent. The plan includes a first action object that transforms a first concept object associated with the intent into a second concept object and also includes a second action object that transforms the second concept object into a third concept object associated with a goal of the intent. The first action object and the second action object are selected from multiple action objects. The system executes the plan, and outputs a value associated with the third concept object.
    Type: Grant
    Filed: August 18, 2014
    Date of Patent: March 14, 2017
    Assignee: Viv Labs, Inc.
    Inventors: Mark Gabel, Christopher Brigham, Adam Cheyer
  • Patent number: 9558239
    Abstract: A query plan for executing a query within a relational database system including at least one non-relational data source is generated by analyzing expressions that reference a non-relational data source within a query for the database system via an interface for that non-relational data source, determining for each analyzed expression at least one of the database system and interface capable of processing that analyzed expression for executing the query, providing an indicator for each of the analyzed expressions that indicates at least one of the database system and interface determined to process that analyzed expression, and generating the query plan for execution of the query, via the database system, based on the indicators for the expressions of the query.
    Type: Grant
    Filed: July 16, 2012
    Date of Patent: January 31, 2017
    Assignee: International Business Machines Corporation
    Inventors: Arthur F. Kaufmann, Haifeng Li
  • Patent number: 9542403
    Abstract: Identifying symbolic links in network file systems is provided. An absolute path may be determined at a network file server. This may include determining a complete client path from an initial client path and combining the complete client path with a server export path. Once the absolute path is determined, it may be traversed using a file descriptor of each file in the absolute path to identify a symbolic link.
    Type: Grant
    Filed: November 20, 2014
    Date of Patent: January 10, 2017
    Assignee: International Business Machines Corporation
    Inventors: Venkateswararao Jujjuri, Sripathi Kodi, Mohan Kumar Mohan Raj, Aneesh K. Veetil
  • Patent number: 9524316
    Abstract: The disclosure relates to of generating a data structure stored in a computer memory for use in performing a search query to determine a separation between nodes in a network of interconnected nodes, wherein the method comprises: selecting a set of landmark nodes from the network; and for at least two of the landmark nodes in the set; generating a path tree for each landmark node that indicates a separation between the landmark node and each of a plurality of nodes; wherein the generating is configured to limit the number of path trees each of said plurality of nodes may appear in to no more than a predetermined number of path trees. A method of processing a data structure is also disclosed.
    Type: Grant
    Filed: April 18, 2014
    Date of Patent: December 20, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Volodymyr Floreskul, Konstantin Tretjakov, Marlon Gerardo Dumas, Ando Saabas
  • Patent number: 9524331
    Abstract: The various embodiments herein provide a method for representing OLAP (Online Analytical Processing) queries in a data grid in real time. The method comprises of providing a new OLAP query, building a directed acyclic graph structure for the OLAP query, initializing the graph structure by generating signals for one or more business entities, processing the generated signals of one or more entities, linking entities based on matching of query filter parameters specified in the OLAP query and calculating aggregate values at one or more nodes. The nodes in the directed acyclic graph comprises: a plurality of blue nodes adapted to maintain links to one or more business entities stored in a datagrid and to hold the aggregate values and a plurality of grey nodes adapted to hold the calculated aggregate values. The aggregate values comprise at least one of SUM, ACCOUNT and AVG.
    Type: Grant
    Filed: November 18, 2013
    Date of Patent: December 20, 2016
    Assignee: NUWAFIN HOLDINGS LTD
    Inventor: Nandakumar Krishnan Nair
  • Patent number: 9525731
    Abstract: A robust tenant placement and migration system, a process, and a respective controller for database-as-a-service environments are disclosed. Multiple tenants (T) are allocated on a set of in-memory database servers (S), such that workload changes depending on the tenants' behavior are considered, while maintaining strict service level objectives. The placement and migration are based on a migration command which, in turn, is based on an interleaved placement by interleaving tenants (T) across servers.
    Type: Grant
    Filed: August 26, 2013
    Date of Patent: December 20, 2016
    Assignee: HASSO-PLATNER-INSTITUT FUER SOFTWARESYSTEMTECHNIK GMBH
    Inventors: Hasso Plattner, Jan Schaffner, TIm Januschowski
  • Patent number: 9519461
    Abstract: A dynamically evolving cognitive architecture system based on third-party developers is described. A system forms an intent based on a user input, and creates a plan based on the intent. The plan includes a first action object that transforms a first concept object associated with the intent into a second concept object and also includes a second action object that transforms the second concept object into a third concept object associated with a goal of the intent. The first action object and the second action object are selected from multiple action objects. The system executes the plan, and outputs a value associated with the third concept object.
    Type: Grant
    Filed: June 17, 2014
    Date of Patent: December 13, 2016
    Assignee: VIV LABS, INC.
    Inventors: Mark Gabel, Christopher Brigham, Adam Cheyer, Dag Kittlaus
  • Patent number: 9495466
    Abstract: A method and apparatus for querying a database table containing point spatial data and without indexes is provided. A request for point spatial data in the table includes a query window provided by the user and describing an area of interest in which the user desires the point spatial data contained therein. The query window is tiled to create interior tiles and boundary tiles. A first query is formed to determine the point spatial data contained in the interior tiles. A second query is formed to determine the point spatial data contained within the boundary tiles and also within the query window. The second query includes a function that tests to determine whether the point spatial data within a boundary tile also lies within the query window. The first and second queries are executed in part on an enhanced data storage device and the results joined and returned to the user in answer to the request.
    Type: Grant
    Filed: November 27, 2013
    Date of Patent: November 15, 2016
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Daniel Geringer, Siva Ravada, Richard J. Anderson, Ying Hu
  • Patent number: 9465850
    Abstract: A database back end system includes a monitoring server operable to poll a first database for a first query running on the first database and add the first query to a query list in a second database, and a reporting server operable to normalize the first query, analyze the second database to find a second query in the query list, wherein the second query is found based upon the normalized first query, and report the second query to a user, wherein the reporting is based upon the analyzing of the second database to find the second query.
    Type: Grant
    Filed: May 5, 2015
    Date of Patent: October 11, 2016
    Assignee: SECUREWORKS CORP.
    Inventor: Wayne Haber
  • Patent number: 9411851
    Abstract: Techniques are disclosed for retrieving both data stored in relational form and data stored in XML form responsive to a single XQuery query. The techniques allow applications to retrieve relational data residing in various relational database management systems by using XQuery and XQuery for Java. In one such embodiment, an embeddable serverless computer component implements the techniques, and includes a combination of one or more relational adaptors and a mediator to access relational data and transform it into appropriate XML. The techniques are embeddable, and can be standards-based, database-independent, and operating-system independent. Optimized performance and scalability from desktop to enterprise applications are enabled as the number of users and/or database size increases.
    Type: Grant
    Filed: April 29, 2013
    Date of Patent: August 9, 2016
    Assignee: Progress Software Corporation
    Inventors: Jonathan Robie, Peter Coppens, Marc Van Cappellen
  • Patent number: 9367607
    Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to portions of the text query, accessing a context-free grammar model, identifying query tokens from the grammar model that correspond to the identified nodes and edges, selecting grammars having query tokens that corresponding to each of the identified nodes and edges, and generating structured queries based on the selected grammars, where the structure queries are based on strings generated by the grammars.
    Type: Grant
    Filed: December 31, 2012
    Date of Patent: June 14, 2016
    Assignee: Facebook, Inc.
    Inventors: Erik N. Vee, Olivier Chatot
  • Patent number: 9305058
    Abstract: There is provided a computer-implemented method of determining an execution ordering. An exemplary method comprises generating a directed graph based on a hierarchy. The hierarchy includes a plurality of pattern queries. The method also includes determining a minimum spanning tree of the directed graph. The method further includes determining an execution order of the pattern queries based on the minimum spanning tree.
    Type: Grant
    Filed: October 31, 2011
    Date of Patent: April 5, 2016
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Chetan Kumar Gupta, Song Wang, Abhay Mehta, Mo Liu, Elke A. Rundensteiner
  • Patent number: 9213732
    Abstract: Aggregation of an in-memory database includes receiving, by at least one processor having a plurality of threads, input having records stored in random access memory, distributing, by the at least one processor, the input into portions, one of the plurality of threads having an assigned portion, aggregating, by the at least one processor, the records in the assigned portion based on locality of keys in the records and outputting, by the at least one processor, the aggregated records into a global hash table.
    Type: Grant
    Filed: December 28, 2012
    Date of Patent: December 15, 2015
    Assignee: SAP AG
    Inventors: Ingo Tobias Müller, Peter Sanders
  • Patent number: 9208199
    Abstract: Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.
    Type: Grant
    Filed: July 12, 2013
    Date of Patent: December 8, 2015
    Assignee: International Business Machines Corporation
    Inventors: Oren Paikowsky, Shimon Stark, Yariv Tzaban
  • Patent number: 9104730
    Abstract: Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.
    Type: Grant
    Filed: June 11, 2012
    Date of Patent: August 11, 2015
    Assignee: International Business Machines Corporation
    Inventors: Oren Paikowsky, Shimon Stark, Yariv Tzaban
  • Patent number: 9087101
    Abstract: Document management techniques to account for user-specific patterns in document metadata are disclosed. In one embodiment, a method for facilitating document retrieval may comprise: assigning a first entitlement to a first user for accessing a first plurality of documents; identifying patterns in the first user's creation or modification of metadata related to the first plurality of documents; recording the identified patterns associated with the first user; receiving a document query from a second user who has been assigned a second entitlement to access a second plurality of documents; determining, based on the second entitlement, an access right of the second user with respect to the first plurality of documents; and modifying the document query based on the access right of the second user and the identified patterns, such that the document query returns relevant documents from the first plurality of documents despite the second user's ignorance of the identified patterns.
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: July 21, 2015
    Assignee: JPMorgan Chase Bank, N.A.
    Inventors: Sih X Lee, Adrian Kunzle
  • Patent number: 9037571
    Abstract: Methods and systems for a topology service providing an interface for specifying a topology and answering queries regarding the topology. Further, the topology service may create, from a specified topology, a directed acyclic graph and corresponding closure table. The topology service may also provide an interface for receiving metadata regarding the topology. In this way, the topology service, based at least in part on connections between nodes in the entries of the closure table and based at least in part on the metadata regarding the topology, may answer queries in regard to the specified topology.
    Type: Grant
    Filed: March 12, 2013
    Date of Patent: May 19, 2015
    Assignee: Amazon Technologies, Inc.
    Inventors: Matthew Paul Baranowski, Jacob Adam Gabrielson, Vijayaraghavan Apparsundaram
  • Patent number: 9031985
    Abstract: An electronic media distribution/play system includes a service facility that has a communications network interface and maintains a data file catalog. The catalog is sent over the network to requesting users, and the system processes payments from customers in establishing file access authorizations. Encrypted user-selected files and a player program are transmitted to each customer for metered access to received data files as limited by the authorization, and customers can make additional selections and play the encrypted files freely while the authorization remains established. The system can transmit the data files from local storage, and also provide links to encrypted files that are stored at remote vendor facilities. Authorizations can be for selected portions or class levels of the catalog, and for terms measured as calendar time, play time, and collective number of plays. Also disclosed is a method for facilitating the distribution and accessing of electronic files.
    Type: Grant
    Filed: January 21, 2011
    Date of Patent: May 12, 2015
    Assignee: B# On Demand, LLC
    Inventor: Gregg S. Homer
  • Patent number: 9021452
    Abstract: Systems and methods for demonstrating a replacement information management software for a computing system. The methods may include determining if existing information management software is installed in the computing system. The methods may include identifying computing devices of the computing system using information from the existing information management software. The methods may include simulating the replacement information management software with characteristics of the identified computing devices to enable a user to experience the replacement information management software prior to committing to installing the replacement information management software in the computing system. The methods may include automatically installing the replacement information management software. Other implementations are disclosed.
    Type: Grant
    Filed: February 26, 2013
    Date of Patent: April 28, 2015
    Assignee: CommVault Systems, Inc.
    Inventor: Sanjay Harakhchand Kripalani
  • Patent number: 9020933
    Abstract: Systems and methods for identifying inadequate search content are provided. Inadequate search content, for example, can be identified based on statistics associated with the search queries related to the content.
    Type: Grant
    Filed: September 23, 2011
    Date of Patent: April 28, 2015
    Assignee: Google Inc.
    Inventors: Jeffrey David Oldham, Hal R. Varian, Matthew D. Cutts, Matt Rosencrantz
  • Patent number: 9015480
    Abstract: Systems and methods are provided for transmitting data for secure storage. For each of two or more data sets, a plurality of shares are generated containing a distribution of data from an encrypted version of the data set. The shares are then stored in a shared memory device, wherein a data set may be reconstructed from a threshold number of the associated plurality of shares using an associated key. Also provided are systems and methods for providing access to secured data. A plurality of shares containing a distribution of data from an encrypted version of a data set are stored in a memory device. A client is provided with a virtual machine that indicates the plurality of shares, and the capability to reconstruct the data set from the plurality of shares using an associated key.
    Type: Grant
    Filed: August 22, 2013
    Date of Patent: April 21, 2015
    Assignee: Security First Corp.
    Inventors: Rick L. Orsini, Mark S. O'Hare, Matt Staker
  • Patent number: 8996501
    Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.
    Type: Grant
    Filed: December 8, 2011
    Date of Patent: March 31, 2015
    Assignee: HERE Global B.V.
    Inventor: Martin Pfeifle
  • Patent number: 8983931
    Abstract: 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: Grant
    Filed: November 29, 2011
    Date of Patent: March 17, 2015
    Assignee: Sybase, Inc.
    Inventor: Mohyuddin Rehmattullah
  • Publication number: 20150074084
    Abstract: A method and system for processing a query on a key-value store, including receiving a query, determining a data path in a cube based on dimensions of the received query, traversing the data path using a data path iterator from a root to blocks in the key-value store, allocating a query slice, determining rows and columns in the query slice using the data path, reading the blocks traversed by the data path iterator from a storage area, merging each of the blocks into a result cell of the query slice, and outputting the query slice.
    Type: Application
    Filed: September 12, 2013
    Publication date: March 12, 2015
    Applicant: NEUSTAR, INC.
    Inventor: Steven Bogrett
  • Publication number: 20150074083
    Abstract: Disclosed are techniques employed alone or in combination, to further enhance a database language and improve conciseness and comprehensiveness of query statements in application code. Embodiments may build upon an initial extension of database language to accommodate concepts of entity-relationship models (ERMs). That initial extension may include entities with structured types, and named associations. One technique modifies SQL to allow the SELECT command to specify element path expressions based upon a relationship (e.g. named associations between ERM elements). Another technique modifies SQL to introduce filter expressions suffixed to associations within path expressions, thus improving adherence to the principle of locality within query statements. Yet another technique allows a shorthand to “factor out” association path prefixes, thereby avoiding lengthy lists of path expressions in order to read several elements from the same nested structure or a same target entity behind a single association.
    Type: Application
    Filed: September 6, 2013
    Publication date: March 12, 2015
    Applicant: SAP AG
    Inventors: Daniel Hutzel, Timm Falter, Stefan Baeuerle
  • Patent number: 8972378
    Abstract: 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: Grant
    Filed: October 22, 2012
    Date of Patent: March 3, 2015
    Assignee: Microsoft Corporation
    Inventors: Alan Dale Halverson, Eric R. Robinson, Srinath Shankar, Jeffrey F. Naughton
  • Patent number: 8965918
    Abstract: A method, article of manufacture and apparatus for decomposing an initial query into smaller conditional groups for execution on a database is disclosed. A separate database query may be generated for each of the conditional groups, and the results of executing these separate database queries may be combined and returned as the result of the initial query. Typically, the initial query may be decomposed because it is otherwise too large and/or too complex to be executed directly.
    Type: Grant
    Filed: January 21, 2013
    Date of Patent: February 24, 2015
    Assignee: International Business Machines Corporation
    Inventors: Richard D. Dettinger, Daniel P. Kolz, Frederick A. Kulack
  • Patent number: 8959112
    Abstract: A computer-implemented method of semantically linking, by a computing device, a citing document to a cited document in a corpus of documents includes locating at least one citation present in the citing document, determining a reason-for-citing for at least one citation, and determining a cited-text-area present in the cited document, wherein the cited-text-area corresponds with the reason-for-citing. The method further includes populating a citation entry of a citation-pairing metadata file with a citing-document identifier, a reason-for-citing identifier, a cited-document identifier, and a cited-text-area identifier. The citation-pairing metadata file includes a plurality of citation entries and is stored separately from the citing document and the cited document.
    Type: Grant
    Filed: February 6, 2013
    Date of Patent: February 17, 2015
    Assignee: LexisNexis, a division of Reed Elsevier, Inc.
    Inventors: Paul Zhang, Harry Silver, Timothy L. Humphrey
  • Patent number: 8949213
    Abstract: Disclosed herein are systems, methods, and computer-readable media for dynamically managing data-centric searches. The method includes identifying an event related to domain-specific searches to a database, identifying data at a first memory location in the database, duplicating the data to a new memory location, and distributing processing more domain-specific searches amongst an expanded search space including the new memory location and the first memory location. The expanded search space can be reduced or collapsed in response to a reduction event by removing duplicate data from the first memory location or the new memory location and adjusting the distribution of processing amongst the remaining memory location. The method can optionally include organizing multiple events by network segment, identifying a network segment associated with domain-specific searches, and duplicating the data to a new memory location in close proximity to the identified network segment.
    Type: Grant
    Filed: August 5, 2013
    Date of Patent: February 3, 2015
    Assignee: Adaptive Computing Enterprises, Inc.
    Inventor: David Brian Jackson
  • Patent number: 8943034
    Abstract: The present description refers to a computer implemented method, computer program product, and computer system to store a node dependency network that includes a plurality of data nodes and one or more links between two or more data nodes, each link representing a data dependency between instances of the two or more data nodes, to forward a requested change to a first data node from a first change control component to a change control manager, identify, by the change control manager based upon the links within the node dependency network, one or more dependent data nodes that are dependent upon the first data node, and determine one or more dependent changes to be performed to one or more instances of the dependent data nodes to maintain consistency among instances of the data nodes.
    Type: Grant
    Filed: December 22, 2011
    Date of Patent: January 27, 2015
    Assignee: SAP SE
    Inventor: Winfried Schwarzmann
  • Patent number: 8938052
    Abstract: A voice channel connection and a data channel connection are established with a structured voice interaction system. Navigation information for and provided by the structured voice interaction system is received over the data channel connection. The data channel navigation information is coordinated with navigation information provided by the structured voice interaction system over the voice channel connection.
    Type: Grant
    Filed: June 5, 2013
    Date of Patent: January 20, 2015
    Assignee: The Invention Science Fund I, LLC
    Inventors: Alexander J. Cohen, Edward K. Y. Jung, Royce A. Levien, Robert W. Lord, Mark A. Malamud, John D. Rinaldo, Jr.
  • Patent number: 8938444
    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.
    Type: Grant
    Filed: December 29, 2011
    Date of Patent: January 20, 2015
    Assignee: Teradata US, Inc.
    Inventors: Yu Xu, Olli Pekka Kostamaa
  • Patent number: 8930347
    Abstract: A method for storing intermediate result sets in a database is provided. An access plan for a single query for accessing data stored in the database system is received. An intermediate result set is generated during execution of the access plan. A value of an intermediate result set rating of the intermediate result set is determined during execution of the access plan at runtime of the query for determining if the intermediate result set, generated during the execution of the access plan, is to be stored. Based on determining that the value of the intermediate result set rating meets a predefined criterion, the determined intermediate result set is stored for a longer period of time than the runtime of the query as a stored intermediate result set.
    Type: Grant
    Filed: December 11, 2012
    Date of Patent: January 6, 2015
    Assignee: International Business Machines Corporation
    Inventors: Bjoern Broll, Torsten Steinbach
  • Patent number: 8930346
    Abstract: Methods for identifying symbolic links in network file systems are provided herein. An absolute path may be determined at a network file server. This may include determining a complete client path from an initial client path and combining the complete client path with a server export path. Once the absolute path is determined, it may be traversed using a file descriptor of each file in the absolute path to identify a symbolic link.
    Type: Grant
    Filed: April 18, 2012
    Date of Patent: January 6, 2015
    Assignee: International Business Machines Corporation
    Inventors: Venkateswararao Jujjuri, Sripathi Kodi, Mohan Kumar Mohan Raj, Aneesh K Veetil
  • Patent number: 8924698
    Abstract: A grouping apparatus manages user information, and executes grouping processing for extracting a subset which matches a predetermined condition from a set of users. A flow control apparatus transmits a set of users to one of a plurality of grouping apparatuses, and transmits a condition used in grouping processing to each of the plurality of grouping apparatuses. One of the grouping apparatuses transmits, to another grouping apparatus, a first subset which is extracted by executing grouping processing on the set transmitted from the flow control apparatus. The other grouping apparatus extracts a second subset by executing grouping processing on the first subset transmitted from the one of the grouping apparatuses.
    Type: Grant
    Filed: December 1, 2010
    Date of Patent: December 30, 2014
    Assignee: NEC Corporation
    Inventor: Takao Takenouchi
  • Patent number: 8918388
    Abstract: 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: Grant
    Filed: March 31, 2010
    Date of Patent: December 23, 2014
    Assignee: Turn Inc.
    Inventor: Songting Chen
  • Patent number: 8914355
    Abstract: Systems and processes for data presentation may be implemented with a variety of operations and techniques. In particular aspects, a system and process for data presentation may include the ability to receive a data request at a data distribution device and determine data responsive to the data request, the responsive data including textual data. The system and process may also include the ability to modify the textual responsive data based on a user interface for visually presenting the textual responsive data and generate a data response including the modified textual responsive data.
    Type: Grant
    Filed: June 17, 2013
    Date of Patent: December 16, 2014
    Assignee: Google Inc.
    Inventors: Maryam Garrett, Shumeet Baluja, Cedric Beust, Elad Gil
  • Patent number: 8914352
    Abstract: 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: Grant
    Filed: July 10, 2007
    Date of Patent: December 16, 2014
    Assignee: Teradata US, Inc.
    Inventors: Michael Chaves, Kasturi Belur, Scott Shelton, Henry Fu
  • Patent number: 8909632
    Abstract: A method, system and computer-usable medium are disclosed for maintaining persistent links to information stored on a network. Information elements are tagged and their original network location is saved as a hyperlink. The tagged information elements are then acquired at the original network location by a search engine crawler, indexed by a search engine, and stored in an information location index. The tagged information elements are periodically submitted to the search engine to generate search results. Comparison operations are performed to determine the search results comprising the closest-matching information elements and their current network location. The network location stored in the hyperlink is replaced with the current network location if it is not the same.
    Type: Grant
    Filed: October 17, 2007
    Date of Patent: December 9, 2014
    Assignee: International Business Machines Corporation
    Inventors: Saurabh Shukla, Mandar U. Jog, Shreyansh Shukla, Scott W. Newman