Based On Access Path Patents (Class 707/716)
-
Patent number: 8447974Abstract: An approach is provided for managing access rights of users to information spaces using signatures stored in a memory tag. A signature manager caused reading of a memory tag to initiate a request, from a device, for an initial access to an information space. The request includes an authorization signature associated with the device. The signature manager determines a level of access to the information space by comparing the authorization signature against a lattice of signature primitives associated with the information space. The signature manager then modifies the authorization signature based on the determination and stores the modified authorization signature for validation of subsequent access to the information space by the device.Type: GrantFiled: November 19, 2009Date of Patent: May 21, 2013Assignee: Nokia CorporationInventors: Sergey Boldyrev, Ian Justin Oliver, Jari-Jukka Harald Kaaja, Joni Jorma Marius Jantunen, Jarmo Tapani Arponen
-
Patent number: 8447756Abstract: The information retrieval devices of the present invention are composed of two dual hierarchical structures, the first structure containing the premises and the second the consequences/prescriptions arising from the premises. According to a variant embodiment, the information is represented by a collection of nested folded sheets not bound to one another. Advantage: reduction of the space or of the paper required for storing the information and reduction of the processing time.Type: GrantFiled: December 9, 2010Date of Patent: May 21, 2013Inventor: Pierre-Yves Tschanz
-
Patent number: 8433718Abstract: A method, system and computer program product for providing translated web content is disclosed. The method includes receiving a request from a user on a web site, the web site having a first web content in a first language, wherein the request calls for a second web content in a second language. The method further includes dividing the first web content into a plurality of translatable components and generating a unique identifier for each translatable component. The method further includes identifying a plurality of translated components of the second web content using the unique identifier of each of the plurality of translatable components of the first web content and putting the plurality of translated components of the second web content to preserve a format that corresponds to the first web content. The method further includes providing the second web content in response to the request that was received.Type: GrantFiled: April 28, 2011Date of Patent: April 30, 2013Assignee: Motionpoint CorporationInventors: Enrique Travieso, Adam Rubenstein
-
Publication number: 20130103671Abstract: A search query to provide a search result may be received, which identifies source and target nodes and an application for generating the search result. The application accesses a data structure holding landmark nodes, which store a shortest path tree in the form of a set of parent links. Each parent link can identify an adjacent vertex node in a shortest path between each node in the data structure and the landmark node. The location of the source node and the target node in the shortest path trees may be identified to the landmark node. For each landmark node, using the identified locations of the target node and source node, a measure of distance between the source node and the target may be generated. The landmark node with the shortest distance may be determined. A search result related to the shortest path tree of that landmark node may be provided.Type: ApplicationFiled: December 30, 2011Publication date: April 25, 2013Inventors: Konstantin Tretjakov, Luciano Garcia-Bañuelos, Abel Armas-Cervantes, Jaak Vilo, Marlon G. Dumas
-
Patent number: 8423523Abstract: A computer readable storage medium includes executable instructions to derive from a database schema an irreducible ambiguous group comprising a sub-schema with a set of vertices wherein any two vertices are part of a loop. Contexts are defined on the sub-schema. For each context, joins in the sub-schema are designated as mandatory joins, excluded joins and neutral joins. A selection of a context from multiple contexts invoked by a path characterizing a query is processed. The query is resolved using the context.Type: GrantFiled: November 13, 2008Date of Patent: April 16, 2013Assignee: SAP France S.A.Inventors: Gilles Vergnory-Mion, Jean-Yves “Yannick” Cras, Pascale Mariani, Yann Delacourt
-
Patent number: 8423569Abstract: 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: GrantFiled: August 9, 2006Date of Patent: April 16, 2013Assignee: International Business Machines CorporationInventors: Richard D. Dettinger, Daniel P. Kolz, Frederick A. Kulack
-
Patent number: 8396863Abstract: A temporal relational database includes a relational database framework that allows for all the capabilities of a standard relational database with the addition of the concept of time. Transactions, which can be modifications of attribute values or changes to the database schema, can be stored with temporal histories. Through the use of these temporal histories, the temporal database is able to seamlessly respond to queries for times that are in the past, present, or future. Furthermore, transactions can be entered into the temporal relational database that are not effective until some point in the future, thus allowing for seamless migration of the data and schema of a database. Applications that access data in a temporal database may retrieve a time appropriate schema from the temporal database. An exemplary use of a temporal database to manage roles and responsibilities within an organization is described.Type: GrantFiled: December 2, 2008Date of Patent: March 12, 2013Assignee: Oracle International CorporationInventor: Bryan Hughes
-
Patent number: 8392400Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.Type: GrantFiled: March 29, 2006Date of Patent: March 5, 2013Assignee: Amazon Technologies, Inc.Inventors: Patrick W. Ransil, Aleksey V. Martynov, James S. Larson, James R. Collette, Robert Wai-Chi Chu, Partha Saha
-
Patent number: 8386471Abstract: In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a database statistic is generated for a number of related records for one or more entities for at least one tenant and a related record is a record with a relationship to a shared record in a database table for an entity from the one or more entities, a first cost is calculated for accessing the number of related records for at least one tenant, a second cost is calculated for accessing a number of related records accessible to a user, a comparison of the first cost to the second cost is performed to determine a data access path for retrieving accessible related records, and the data access path for retrieving accessible related records is determined based upon the comparison.Type: GrantFiled: September 17, 2010Date of Patent: February 26, 2013Assignee: Salesforce.com, Inc.Inventors: Jesse Collins, Jaikumar Bathija
-
Patent number: 8386451Abstract: The present invention provides a system and method of managing Internet browser navigation. Software code designed to interact with and control the user's Internet browser is embedded into web pages made available to remote users by a web server. Embedded software code is read by the user's Internet browser upon loading a requested web page. Embedded software code directs the browser to store one or more attributes upon the remote user's computer system. Stored attributes may then be compared to attributes embedded within subsequently requested web pages to determine if the requested web page, or a corrected web page, should be displayed.Type: GrantFiled: May 17, 2011Date of Patent: February 26, 2013Assignee: United Services Automobile Association (USAA)Inventors: Jeffrey W. Gallagher, Randal L. Schnedler
-
Publication number: 20130046752Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: ApplicationFiled: October 19, 2012Publication date: February 21, 2013Applicant: SALESFORCE.COM, INCInventor: SALESFORCE.COM, INC
-
Patent number: 8380703Abstract: Systems, methods and computer program products are disclosed for managing a database cache. In one embodiment, access to a data object stored in a database is monitored. A memory residency priority for the data object is determined, based on the access patterns. Further, an access plan is determined for a query, based on the memory residency priority. Access to the data object is also monitored when the access plan is executed, thereby providing a feedback loop between determining memory residency priorities and determining query access plans.Type: GrantFiled: July 26, 2010Date of Patent: February 19, 2013Assignee: International Business Machines CorporationInventors: Randy L. Egan, Rafal P. Konik, Roger A. Mittelstadt, Mark W. Theuer
-
Patent number: 8370366Abstract: Embodiments of systems and methods for comparing attributes of a data record are presented herein. Broadly speaking, embodiments of the present invention generate a weight based on a comparison of the name (or other) attributes of data records. More particularly, embodiments of the present invention generate a weight based on a comparison of name attributes. More specifically, embodiments of the present invention may calculate an information score for each of two name attributes to be compared to get an average information score for the two name attributes. The two name attributes may then be compared against one another to generate a weight between the two attributes. This weight can then be normalized to generate a final weight between the two business name attributes.Type: GrantFiled: January 14, 2010Date of Patent: February 5, 2013Assignee: International Business Machines CorporationInventors: Norm Adams, Scott Ellard, Scott Schumacher
-
Patent number: 8370320Abstract: One or more computer assisted methods for using favicons to send queries to searchable webpages and obtain a search results page for each searchable webpage over a network are provided.Type: GrantFiled: May 20, 2011Date of Patent: February 5, 2013Assignee: Accrue Search Concepts, Inc.Inventor: Troy Fearnow
-
Patent number: 8364714Abstract: A system and associated method for improving efficiency and data security of a relational database management system (RDBMS). Access path security is configured for respective users of the RDBMS, having either access-by-key or access-by-scan value. The access-by-key access path security requires an end user to specify a search key in a query as configured for the end user to service the query. Only few users with administrative capacity are configured with the access-by-scan access path security, which permits servicing queries in conventional ways without screening queries by scanning database. The RDBMS calculates the most efficient access path for the query received from the end user, and retrieves data requested by the query only when the calculated access path is permitted by the access path security for the end user.Type: GrantFiled: June 8, 2009Date of Patent: January 29, 2013Assignee: International Business Machines CorporationInventor: John Kliewe
-
Patent number: 8356029Abstract: Methods, systems and articles of manufacture are provided to facilitate efficient searching and reconstruction of entity relationship data in a relational database. The entity relationship data in the relational database is migrated from an object oriented program environment.Type: GrantFiled: August 6, 2010Date of Patent: January 15, 2013Assignee: Google Inc.Inventors: Judy I. Djugash, Travis M. Drucker, Hoa T. Tran
-
Patent number: 8356028Abstract: An information system having a computer readable medium including a flexible data structure is provided. The data structure allows information entered into the data structure to be embellished or qualified. The flexible data structure increases the ability of the data structure to record exceptional information pertinent to specific circumstances. The flexible data structure also enables database access software to respond to user queries in a more effective and informative manner.Type: GrantFiled: December 20, 2004Date of Patent: January 15, 2013Assignee: Xerox CorporationInventor: John O. Lamping
-
Patent number: 8352452Abstract: Methods and apparatus consistent with the invention provide improved organization of documents responsive to a search query. In one embodiment, a search query is received and a list of responsive documents is identified. The responsive documents are organized based in whole or in part on usage statistics.Type: GrantFiled: March 9, 2012Date of Patent: January 8, 2013Assignee: Google Inc.Inventors: Jeffrey A. Dean, Benedict A. Gomes, Krishna Bharat, Georges Harik, Monika H. Henzinger
-
Patent number: 8352476Abstract: Techniques are provided for (2) extending SQL to support direct invocation of frequent itemset operations, (3) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (4) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory.Type: GrantFiled: May 19, 2011Date of Patent: January 8, 2013Assignee: Oracle International CorporationInventors: Wei Li, Jiansheng Huang, Ari Mozes
-
Patent number: 8341019Abstract: In embodiments disclosed, information on a click stream associated with a user and meta tags commonly used by search engines can be used to profile a user. The click stream may comprise network addresses and timestamps and may be the only source of user information used for the profile. The meta tags may contain metadata that correspond to the network addresses in the click stream, including network address categorization for these network addresses. The profile obtained for the user may be an existing profile that represents a person or a theoretical individual having attributes similar to or most closely match the user. Based at least in part on the profile, information regarding an item may be provided to the user or the item may be offered to the user. In some embodiments, the information may be filtered before being displayed to the user.Type: GrantFiled: October 15, 2010Date of Patent: December 25, 2012Assignee: Open Text, S.A.Inventor: Sean M. McCullough
-
Patent number: 8341281Abstract: The present invention discloses a generic protocol translator (32) that translates information from a source device to a destination device. The generic protocol translator (32) includes a receiver circuit manager (92) that receives information from a source device that is intended for a destination device through one or more interface sockets (104). The present invention also includes one or more receivers (106) receive information from the receiver circuit manager. Further included are one or more message converters (110) that convert the information to the destination format using a conversion process. Additionally included is a message router (112) that determines which destination protocol is appropriate for the information. And, the present invention includes one or more message senders (114) that transfer the information in the destination format and protocol to the destination device.Type: GrantFiled: September 3, 2010Date of Patent: December 25, 2012Assignee: Lubec Campobello LLCInventor: Rebecca S. Taylor
-
Patent number: 8341164Abstract: A data structure for storing items of information having a time of life includes a time of life interval for each item of information. The items of information are organized in a data structure having nodes and edges connecting the nodes. This data structure is preferably a directed acyclic graph structure. The data structure includes parent nodes and child nodes. The time interval specified for any child node must always be contained within the time interval specified for that child node's parent node, such that the data structure includes no child nodes with a time of life interval that falls outside of the time of life interval of its parent node.Type: GrantFiled: February 25, 2010Date of Patent: December 25, 2012Inventors: Barr Rosenberg, Mark Gilbeau Howard, Till Gaston Balz Bay, Bernd Kurt Alexander Schoeller
-
Patent number: 8335781Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: May 7, 2010Date of Patent: December 18, 2012Assignee: salesforce.com, inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Patent number: 8332387Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: May 7, 2010Date of Patent: December 11, 2012Assignee: salesforce.com, inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Publication number: 20120310920Abstract: Computer program products and methods for query collection optimization and executing a query collection against one or more electronic documents are disclosed. According to one embodiment, a method of executing a query collection having a plurality of full term queries against an electronic document includes receiving the query collection, determining common terms, and searching the electronic document for the common terms in accordance with a frequency that the common terms appear in the query collection. The method further includes, for each common term found in the electronic document, searching the electronic document for full term queries that include the common term that was found in the electronic document. The method further includes, for each common term not found in the electronic document, preventing a search of the electronic document for the full term queries that include the common term that was not found in the electronic document.Type: ApplicationFiled: April 5, 2012Publication date: December 6, 2012Applicant: LEXISNEXIS, A DIVISION OF REED ELSEVIER INC.Inventor: Robert Drumheller
-
Publication number: 20120303609Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.Type: ApplicationFiled: July 30, 2012Publication date: November 29, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
-
Patent number: 8321405Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: May 7, 2010Date of Patent: November 27, 2012Assignee: salesforce.com, inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Patent number: 8301620Abstract: The approaches described herein provide an efficient way for a database server to process certain kinds of queries that require the evaluation of an aggregation function over XML data stored in an object-relational database. An aggregation function takes multiple inputs and generates a single output. A database server first determines whether the query qualifies for this particular kind of optimization, then creates a query execution plan that specifies the use of an enhanced path-based row source, eliminating the need for a second path-based row source for computing the aggregation function. The enhanced path-based row source specified in the query execution plan computes an aggregation function and stores the result of that function computation in a column of each row. The XPath evaluation results that are the individual inputs to the aggregation function are only stored temporarily until they are used to compute the aggregation function.Type: GrantFiled: May 28, 2009Date of Patent: October 30, 2012Assignee: Oracle International CorporationInventors: Balasubramanyam Sthanikam, Sam Idicula, Nipun Agarwal
-
Patent number: 8296645Abstract: A jump destination site determination method and system determine a site which is a jump destination of a hyperlink selected in a terminal apparatus. The system and method include receiving a jump destination distribution ratio representing a ratio of jumping to each of a plurality of sites storing same contents, which varies over time, and contents including a hyperlink to which the jump destination distribution ratio is correlated, judging whether a time period elapsing from a time the contents are received until a time the hyperlink included in the contents is selected is equal to or longer than a predetermined time period, and acquiring a jump destination distribution ratio effective at a point in time at which the hyperlink is selected from the server responsive to determining that the time period elapsed is equal to or longer than the predetermined time period.Type: GrantFiled: March 12, 2008Date of Patent: October 23, 2012Assignee: Fujitsu LimitedInventor: Hirotaka Shimizu
-
Publication number: 20120265751Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.Type: ApplicationFiled: October 12, 2011Publication date: October 18, 2012Inventors: Douglas Brown, John Mark Morris
-
Patent number: 8290934Abstract: A method for processing access control lists using a hashing scheme includes receiving a packet identifying data and determining a fixed number of a plurality of hash tables comprising a fixed number of two or more buckets comprising a fixed number of one or more entries, such that the two or more hash tables store data in memory associated with an access control list. The method also includes searching the one or more hash tables in parallel for the identifying data using a plurality of hashing functions and returning a search result.Type: GrantFiled: August 6, 2009Date of Patent: October 16, 2012Assignee: fujitsu LimitedInventors: Stergios Stergiou, Jawahar Jain
-
Publication number: 20120259836Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.Type: ApplicationFiled: June 20, 2012Publication date: October 11, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Manish A. Bhide, Venkat Chakravarthy, Mukesh K. Mohania, Girish Venkatachaliah
-
Publication number: 20120259837Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.Type: ApplicationFiled: June 20, 2012Publication date: October 11, 2012Applicant: International Business Machines CorporationInventors: Manish A. Bhide, Venkat Chakravarthy, Mukesh K. Mohania, Girish Venkatachaliah
-
Patent number: 8285709Abstract: In one embodiment, a method includes concurrently executing a set of multiple queries, through a processor, to improve a resource usage within a data warehouse system. The method also includes permitting a group of users of the data warehouse system to simultaneously run a set of queries. In addition, the method includes applying a high-concurrency query operator to continuously optimize a large number of concurrent queries for a set of highly concurrent dynamic workloads.Type: GrantFiled: May 12, 2010Date of Patent: October 9, 2012Assignee: Teradata US, Inc.Inventors: George Candea, Neoklis Polyzotis
-
Patent number: 8285710Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.Type: GrantFiled: October 9, 2008Date of Patent: October 9, 2012Assignee: International Business Machines CorporationInventors: Graham A. Bent, Patrick Dantressangle, David R. Vyvyan
-
Patent number: 8285680Abstract: A method for restoring an object comprises receiving a request to restore an object. Also, the method includes outputting a representation of available backup files and receiving a selection of at least one of the available backup files. Further, the method comprises restoring at least one of the selected backup files into a temporary location and mounting at least one of the restored backup files as a server. In addition, the method includes outputting a representation of available objects from the server and receiving a selection of at least one of the available objects to be restored from the server. Also, the method includes copying one or more selected objects from the server into an Active Directory.Type: GrantFiled: January 8, 2009Date of Patent: October 9, 2012Assignee: International Business Machines CorporationInventors: Bryan Wayne Freeman, Alexei Kojenov, Joanne T. Nguyen, Delbert Barron Hoobler, III
-
Publication number: 20120254153Abstract: Hub based labeling is used, in databases, to determine a shortest path between two locations. Every point has a set of hubs: this is the label (along with the distance from the point to all those hubs). The hubs are determined that intersect the two labels. This information is used to find the shortest distance. A hub based labeling technique uses, in a database, a preprocessing stage and a query stage. Finding the hubs is performed in the preprocessing stage, and finding the intersecting hubs is performed in the query stage using relational database operators, such as SQL queries. During preprocessing, a forward label and a reverse label are defined for each vertex. The labels are generated using contraction hierarchies that may be guided by shortest path covers. A query, such as an SQL query, is processed using the labels to determine the shortest path.Type: ApplicationFiled: November 2, 2011Publication date: October 4, 2012Applicant: Microsoft CorporationInventors: Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
-
Patent number: 8280875Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: May 7, 2010Date of Patent: October 2, 2012Assignee: salesforce.com, inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Patent number: 8280874Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: May 7, 2010Date of Patent: October 2, 2012Assignee: salesforce.com, inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Patent number: 8271479Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.Type: GrantFiled: November 23, 2009Date of Patent: September 18, 2012Assignee: International Business Machines CorporationInventors: Manish A Bhide, Venkat Chakravarthy, Mukesh K Mohania, Girish Venkatachaliah
-
Patent number: 8266136Abstract: Embodiments of the present invention provide a novel technique for maintaining directory-based quota, for performing directory notification to a client system, and performing other such operations by efficiently finding ancestral directory associations on a server system without performing multiple accesses to data structures associated with the directory associations. Since data structures do not need to be accessed multiple times, performance of the server system can be improved.Type: GrantFiled: April 13, 2009Date of Patent: September 11, 2012Assignee: NetApp, Inc.Inventors: Prashant Pogde, Manish M. Agarwal
-
Patent number: 8260799Abstract: The present invention discloses a method and an apparatus for creating a pattern matching state machine and identifying a pattern, and relates to pattern matching technologies. The method includes: obtaining a sub-keyword field after division; generating a state transition (goto) function according to the sub-keyword field; generating a failure function of each state node according to the goto function; generating a next-hop goto function ? of each state node according to the goto function and the failure function; in the process of converting the failure chain, the entry with a failure transition to the initial state is not generated. Therefore, the storage content does not increase massively, the storage structure of the AC algorithm is optimized, and the processing speed of the AC algorithm is improved.Type: GrantFiled: September 28, 2010Date of Patent: September 4, 2012Assignee: Huawei Technologies Co., Ltd.Inventors: Jian Chen, Hong Zhou, Xinyu Hu
-
Publication number: 20120221538Abstract: Methods, systems and computer program products for traversing a level in a search path in a tree data structure by recording a version number of a node on the search path, finding a child pointer in the node on the search path, recording a version number of a child node corresponding to the child pointer, reading a version number of the node on the search path, comparing the recorded version number of the node to the read version number of the node, reading at least one child pointer in the node and comparing the read child pointer to an address of the child node.Type: ApplicationFiled: February 28, 2011Publication date: August 30, 2012Applicant: International Business Machines CorporationInventor: Antti-Pekka Liedes
-
Patent number: 8250062Abstract: A database system may perform a streaming evaluation of an XPath expression by utilizing an XPath evaluation component in tandem with an XML event-streaming component. For a more optimal filtered streaming evaluation, the XML event-streaming component may provide an interface whereby the evaluation component sends certain criteria to the event-streaming component when requesting an XML event. The criteria may be based on a next unmatched step in the XPath expression. In response to the request for an XML event, the event-streaming component may only return events that match the criteria. The evaluation component may be, for example, a compiled state machine for the XPath expression. The criteria may be pre-compiled for each possible state in the state machine. The event-streaming component may also utilize the criteria along with schema information to skip parsing of certain segments of XML data.Type: GrantFiled: November 9, 2007Date of Patent: August 21, 2012Assignee: Oracle International CorporationInventors: Ning Zhang, Sivasankaran Chandrasekar, Nipun Agarwal, Sam Idicula
-
Patent number: 8250063Abstract: A method, apparatus, and computer implemented instructions for restricting a fan-out type search of a distributed database. A search request is received indicating that a requesting node originating the search request desires to avoid receiving search results including inaccessible nodes. Responsive to receiving the search results from other nodes, the search results are filtered to remove search results from inaccessible nodes to form filtered search results. The filtered search results are passed to the requesting node.Type: GrantFiled: October 2, 2008Date of Patent: August 21, 2012Assignee: International Business Machines CorporationInventors: Rabindranath Dutta, Steven Michael French, Janani Janakiraman
-
Patent number: 8244795Abstract: Disclosed is a method and device and computer storage medium for determining whether two pages linked on the World Wide Web are a part of the same World Wide Web site. The method involves examining and comparing the IP addresses of the Web pages, and can also be extended to finding other pages to which a given Web page is linked on the Web, and to determining whether a Web page of interest is part of a Web site with a desired characteristic, such as being part of an electronic commerce site.Type: GrantFiled: February 24, 2004Date of Patent: August 14, 2012Assignees: Verizon Laboratories Inc., Verizon Corporate Services Group Inc.Inventor: Jay Michael Ponte
-
Patent number: 8244715Abstract: A system and/or method are implemented to process queries to a database. In particular, the processing of queries to the database is enhanced by enhancing the determination of join orders of tables implicated in queries. Join orders between relatively large numbers of tables are determined by dividing the set of tables to be ordered into a plurality of subsets of tables, and ordering the individual subsets of tables.Type: GrantFiled: April 9, 2010Date of Patent: August 14, 2012Assignee: Paraccel, Inc.Inventors: Richard L. Cole, Yijou Chen, William J. McKenna, Sergei Perfilov, Aman Sinha, Eugene Szedenits, Jr.
-
Patent number: 8244716Abstract: Information is stored in a data pattern. The data pattern includes an identity table, a version table that includes at least one reference to the identity table, and an audit table that includes at least one reference to the version table. The identity table stores information identifying the information. The version table stores version information identifying one or more versions of the information identified in the identity table. The audit table stores audit information identifying when each of the one or more versions of the information was modified. The audit table may also store effectiveness information identifying when each of the one or more versions of the information is in effect.Type: GrantFiled: June 13, 2008Date of Patent: August 14, 2012Assignee: Oracle International CorporationInventors: Laurence W. Becker, Mark Kleidon, Brent Thomas Jenkins
-
Patent number: 8229922Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: April 8, 2009Date of Patent: July 24, 2012Assignee: salesforce.com, Inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Patent number: 8219546Abstract: An operator manager may be configured to determine a number of available cores and to assign the cores among a plurality of operators of a query, the operators including a running set of operators through which a plurality of query paths exist. The operator manager may include a status monitor configured to determine the number of available cores and to determine the running set of operators, a critical path selector configured to determine a critical path of the query from among the query paths and the running set of operators, and a workload manager configured to assign a first core of the available cores to a running operator of the running set and of the critical path, and to thereafter receive a new critical path from the critical path selector and to assign a second core of the available cores to the running operator of the new critical path.Type: GrantFiled: April 12, 2010Date of Patent: July 10, 2012Assignee: SAP AGInventors: Jianfeng Yan, Jian Xu, Wen-Syan Li