| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 707800000 | Linked lists | 25 |
| 20100057816 | Organizing Internet/Intranet research with interactive Dynamic Research Diagrams and Lists - This is a method of visually organizing research including: progress, history, decisions, notes and results. This method automatically records the details of a research project as it is happening and intuitively allows the user and/or users to add their own information in the process. Organization may be both automatically and manually conducted. The user's research may be displayed in multiple visual layouts allowing for quick review, organization and accessibility to other users. | 03-04-2010 |
| 20100094910 | METHOD AND SYSTEM FOR LINKING AND DELINKING DATA RECORDS - Disclosed herein are various exemplary systems and methods for linking entity references to entities and identifying associations between entities. In particular, a method for delinking one or more entity references linked to a same entity is provided, where the one or more entity references having at least one common data field. The method comprises the steps of evaluating at least one actual measurement of the entity based at least in part on one or more field values of the one or more entity references, determining a difference between the at least one actual measurement and at least one predefined measurement associated with the entity and delinking the one or more entity references based at least in part on a comparison of the difference and a defined threshold. | 04-15-2010 |
| 20110087705 | SYSTEMS, APPARATUS, METHODS AND COMPUTER-READABLE STORAGE MEDIA FOR FACILITATING MANAGEMENT OF SOCIAL MEDIA INFORMATION FOR COMMUNICATION DEVICES - Systems, apparatus, methods and computer-readable storage media facilitating management of social media (SM) information are provided. In some embodiments, a method can include: executing a batch linking application; and batch linking one or more social network (SN) contacts to one or more contacts stored on or accessible by the communication device, wherein the batch linking comprises obtaining the one or more SN contacts at the communication device, wherein the one or more SN contacts are selected for the batch linking based, at least, on a correspondence to the one or more contacts, and wherein the batch linking is performed by the communication device. | 04-14-2011 |
| 20110145296 | FILE SYSTEM ACTIVE SYMBOLIC LINK - Data stored on a storage medium can be referenced by multiple independently addressable active symbolic links, with each active symbolic link representing the data through a different transformation. The active symbolic links can be in the form of file system objects, such as files or directories. A single active symbolic link can reference the data stored in multiple collections, or, conversely, a subset of data from a single collection. Active symbolic links can be automatically created for common data transformations. Searching across active symbolic links referencing encrypted data can be performed by multiple protection-specific search engines, or a single search engine that can generate a protection-level aware search index. | 06-16-2011 |
| 20110208782 | METHOD AND COMPUTER PROGRAM PRODUCT FOR CREATING ORDERED DATA STRUCTURE - The present invention provides a method and computer program product for creating an ordered data structure for storing a plurality of data elements. The data elements to be stored are first arranged in an order. A plurality of keys is then generated for the ordered data elements such that the keys may be arranged in a sequence. Thereafter, one or more keys from the plurality of keys are associated with the ordered data elements such that the values of the keys maintain the requisite order among the ordered data elements. Finally, an ordered data structure is created for storing the ordered data elements along with the associated keys. | 08-25-2011 |
| 20110208783 | Integration of User Identifiers - User identifiers associated with a plurality of enterprises may be integrated. A request is received to link a plurality of user identifiers associated with a plurality of enterprises. A first user identifier associated with a first enterprise is received, and a second user identifier associated with a second enterprise is received. The first user identifier and a first enterprise identifier are stored in a first data structure of a memory. The second user identifier and a second enterprise identifier are stored in a second data structure of the memory. A first account identifier associated with the first user identifier is determined by a processor. A second account identifier associated with the second user identifier is determined by the processor. The first user identifier, the second user identifier, the first account identifier, and the second account identifier are stored in a virtual profile to link the first and second user identifiers and facilitate retrieval of information associated with the first and the second user identifiers from a selected one of the first enterprise and the second enterprise. | 08-25-2011 |
| 20110231449 | System, Method, and Apparatus for Managing Patent Reference Reporting - A reporting database establishes linkages between patent applications so that first references reported in a first patent application are indicated as needing to be reported in a second patent application. In one scenario, a similar second linkage is also established between the second patent application and a third patent application. In such a case, there may be no linkage between the first patent application and the third patent application analogous to the first and second linkages. When it is detected in such a case that the first references have been reported in the second patent application, an indication that the first references need to be reported in the third patent application may prevented based on determining that the first references did not originate from the second patent application. | 09-22-2011 |
| 20110307521 | SYSTEM AND METHOD FOR STORING DATA IN A RELATIONAL DATABASE - In a method for storing data in a relational database system using a processor, a collection of values is assigned to a structure dictionary, wherein each of the values represents the value of a row for an attribute and has a unique ordinal number within the collection, and wherein the structure dictionary contains structures defined based on at least one of interaction with a user of the system via an interface, automatic detection of structures occurring in data, and predetermined information about structures relevant to data content that is stored in the system. For each structure in the structure dictionary, a structure match list is formed from ordinal numbers of values matching the structure, and a structure sub-collection from values matching the structure, using the processor. An outlier match list is formed from ordinal numbers of values that are not null and do not match any structure in the structure dictionary, and an outlier sub-collection from values that are not null and do not match any structure in the structure dictionary. The collection of values is stored in the relational database in a form of structure match lists, structure sub-collections, outlier match list and outlier sub-collection. | 12-15-2011 |
| 20120011166 | SKIP LIST GENERATION - A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria. | 01-12-2012 |
| 20120078970 | Performance of Hash Tables - A method, computer program product, and system for partitioning keys for a hash table in order to improve performance of the hash table. A hash function is used to generate a hash table by mapping a set of keys to a corresponding set of hash codes, and a hash failure is detected if the hash function fails to map the entire set of keys. To resolve the hash failure, the set of keys is partitioned to form subsets of keys that can be individually mapped. | 03-29-2012 |
| 20120089647 | METHODS AND SYSTEMS FOR LATENCY-FREE DATABASE QUERIES - Systems and methods for performing latency-free database searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set. | 04-12-2012 |
| 20120096044 | DATA ALLOCATION IDENTIFICATION - Various embodiments illustrated and described herein pertain to at least one of systems, methods, databases, and instructions stored on computer-readable mediums for data allocation identification. One method according to some embodiments includes determining a database allocation of an entity and identifying a domain directly associated with the entity. The method may further include determining at least one header table field directly associated with the entity by identifying a directly associated type definition linked to the directly associated domain, wherein the directly associated type definition refers to the header table field, wherein each header table field is in a corresponding header table. This, and other embodiments, are illustrated and describe in detail herein. | 04-19-2012 |
| 20120323970 | DYNAMIC LOCK-FREE HASH TABLES - A table update component may perform updates on a dynamic linear hash table, the updates requested by clients based on request item values. A table capacity status component may determine first capacity indicators associated with the dynamic linear hash table, based on results of the update requests. A table maintenance component may initiate lock-free merges and lock-free splits of hash table buckets associated with the dynamic linear hash table, based on initiating lock-free merges and lock-free splits of linked lists included in hash table buckets associated with the dynamic linear hash table, based on the determined first capacity indicators, the linked lists including hashed items stored in the dynamic linear hash table. | 12-20-2012 |
| 20130091175 | ELECTRONIC DISCOVERY SYSTEM - Embodiments of the invention relate to systems, methods, and computer program products for improved electronic discovery and custodian management. Embodiments herein disclosed provide for an enterprise wide e-discovery system that provides for data to be identified, located, retrieved, preserved, searched, reviewed and produced in an efficient and cost-effective manner across the entire enterprise system. In addition, by structuring management of e-discovery based on case/matter, custodian and data and providing for linkage between the same, further efficiencies are realized in terms of identifying, locating and retrieving data and leveraging results of previous e-discoveries with current requests. | 04-11-2013 |
| 20130124575 | System and Method for Dynamic Meta-Data in Control and Visualization - An automation control and monitoring system is provided that includes an automation control component and a data store. The automation control component is configured to store measurement data acquired from a sensing component of the automation control system in onboard memory. The automation control component is configured to store the measurement data in the onboard memory in a manner defined by a data structure of the measurement data. The data store is configured to store and dynamically associate meta-data with the measurement data acquired from the sensing component such that the meta-data extends the data structure by linking at least portions of the meta-data with the measurement data. | 05-16-2013 |
| 20130198241 | DATABASE MANAGEMENT METHOD FOR PROVIDING NEW KEYWORD, COMPUTER-READABLE MEDIA AND COMPUTING APPARATUS FOR THE SAME METHOD - A network management method is provided, which includes creating one or more networks defined by a closed loop based on unidirectional links among basic memory units, and creating a new network based on a new closed loop which is constructed based on two or more networks. Accordingly, it is possible to read information regarding another associated networks, upon reading about information regarding one of the created networks. | 08-01-2013 |
| 20140025709 | CONCURRENT INSERTION OF ELEMENTS INTO DATA STRUCTURES - A method of adding an element to a data structure may include atomically associating the element with the data structure if the element is not associated with the data structure. The element may be prepared for insertion into a location in the data structure. The method may also include atomically inserting the element into the location in the data structure if another element has not been inserted into the location. | 01-23-2014 |
| 20150134702 | LINKING BUSINESS OBJECTS AND DOCUMENTS - Managing content is disclosed. An indication is received that a content item comprising a body of managed content is associated with a business object not included in the body of managed content. The content item is linked with the business object. | 05-14-2015 |
| 20150310003 | METHODS, SYSTEMS, AND DEVICES FOR MACHINES AND MACHINE STATES THAT MANAGE RELATION DATA FOR MODIFICATION OF DOCUMENTS BASED ON VARIOUS CORPORA AND/OR MODIFICATION DATA - Computationally implemented methods and systems include acquiring a document corpus that includes one or more outcome-linked documents, wherein the one or more outcome-linked documents are linked to an objective outcome, generating relation data that corresponds to data about one or more characteristics of the document corpus, and transmitting the generated relation data, wherein the generated relation data is configured to be used by an automated document analysis component to analyze a target document that has a characteristic in common with at least one of the one or more outcome-linked documents. In addition to the foregoing, other aspects are described in the claims, drawings, and text. | 10-29-2015 |
| 20150310128 | METHODS, SYSTEMS, AND DEVICES FOR MACHINES AND MACHINE STATES THAT MANAGE RELATION DATA FOR MODIFICATION OF DOCUMENTS BASED ON VARIOUS CORPORA AND/OR MODIFICATION DATA - Computationally implemented methods and systems include acquiring a document corpus that includes one or more outcome-linked documents, wherein the one or more outcome-linked documents are linked to an objective outcome, generating relation data that corresponds to data about one or more characteristics of the document corpus, and transmitting the generated relation data, wherein the generated relation data is configured to be used by an automated document analysis component to analyze a target document that has a characteristic in common with at least one of the one or more outcome-linked documents. In addition to the foregoing, other aspects are described in the claims, drawings, and text. | 10-29-2015 |
| 20160042092 | AUTOMATED CREATION AND DELIVERY OF DATABASE CONTENT - A method and apparatus are disclosed which automatically build a database by automatically assigning links to an expert, pushing content to an expert, providing expert annotation, and linking the content to an annotation database. A term is selected by applying rules. An advertiser can sponsor the term. Content windows can be attached to the term, the content window containing information such as definitions, related products or services, sponsorship information, information from content syndicators, translations and reference works. A utility is available to the expert that allows the expert to analyze the term in context by extending or reducing the sentence or paragraph the word is contained in. Data objects that represent the contents of the database and templates are syndicated to remote servers running a processing engine. The processing engine uses these data objects to execute linking rules without requiring a connection to the database. | 02-11-2016 |
| 20160057311 | Method of Providing Digital Directory Information for a Printed Document - Embodiments of the invention described in this patent provide a process that improves the manner in which the readers of a printed journal can access contact information of a company listed in this index of advertised companies and/or advertisers. The reader may query, for example, company main phone number and address, company branches' addresses, company department phone numbers, phone numbers and addresses of retail stores, phone numbers and addresses of technical support places, business times and other important information for communication between the magazine reader and the company advertised on the magazine index. This process, therefore, facilitates the contact and access of readers of printed media to the advertised companies on index pages of printed magazines. | 02-25-2016 |
| 20160154897 | METHOD OF AND SYSTEM FOR STORING SPATIAL OBJECTS | 06-02-2016 |
| 20160179981 | SYSTEM, METHOD, AND PROGRAM FOR AGGREGATING DATA | 06-23-2016 |
| 20160188749 | Feed Data Storage and Query - Methods and devices for storing and querying feed data. A method includes generating, by a computing device, multiple shards from feed data of an individual user. An individual shard may include first data, second data and third data. The computing device may thereby form a linked list structure of the multiple shards, and store the individual shard in a storage system. When the user sends a query for feed data, the computing device may obtain a unique identifier from the query, and search the storage system using the unique identifier. The computing device may then determine the current shard based on the unique identifier in the storage system and an additional shard corresponding to the third data of the current shard. The computing device may return the first data and second data of the additional shard to the user. | 06-30-2016 |
