Using Directory Or Table Look-up (epo) Patents (Class 707/E17.037)
  • Patent number: 11531641
    Abstract: Mechanisms are provided for adjusting a configuration of data stored in a storage system. According to various embodiments, a storage module may be configured to store a configuration of data. A processor may be configured to identify an estimated performance level for the storage system based on a configuration of data stored on the storage system. The processor may also be configured to transmit an instruction to adjust the configuration of data on the storage system to meet the service level objective when the estimated performance level fails to meet a service level objective for the storage system.
    Type: Grant
    Filed: November 13, 2018
    Date of Patent: December 20, 2022
    Inventors: Goutham Rao, Ratna Manoj Bolla, Vinod Jayaraman
  • Patent number: 11520790
    Abstract: In an approach for character encoding, a processor receives a first query involving an attribute, wherein the first query utilizes a value encoded in accordance with a first encoding scheme. A processor identifies a table comprising values of the attribute in a compressed format. A processor creates at least one dictionary associated with the attribute, wherein the at least one new dictionary associated with the attribute maps a compressed value to a corresponding uncompressed value. A processor executes the first query by invoking a conversion operation in a query plan of the first query for decoding one or more queried values of the attribute. A processor fills the at least one new dictionary with one or more decoded query values to create at least one full dictionary. A processors stores the at least one full dictionary in a cache using a predefined cache management policy of the cache.
    Type: Grant
    Filed: September 17, 2020
    Date of Patent: December 6, 2022
    Assignee: International Business Machines Corporation
    Inventors: Felix Beier, Knut Stolze, Luis Eduardo Oliveira Lizardo, Reinhold Geiselhart
  • Patent number: 11496117
    Abstract: A method for updating a stable cuckoo filter used for membership testing of data streams, executed by a processor, is described. The method includes the steps of: performing a first hash on a first element to be inserted into the stable cuckoo filter to determine a first candidate bucket; performing a second hash on a fingerprint of the first element to determine a second candidate bucket; selecting a target candidate bucket from a group consisting of the first candidate bucket and the second candidate bucket; inserting the first element into the target candidate bucket; updating the stable cuckoo filter according to one or more of a random update strategy, an insertion failure update strategy, a scanning strategy, a skip scanning update strategy, a blocked design strategy and a local time-sensitive update strategy; and obtaining an updated stable cuckoo filter.
    Type: Grant
    Filed: August 25, 2021
    Date of Patent: November 8, 2022
    Inventor: Deke Guo
  • Patent number: 11403085
    Abstract: A data collection system includes a first device that includes a generation unit configured to generate installation data including an edge-server function program for collecting data items generated by a device group including plural devices and a transmission unit configured to transmit the installation data generated by the generation unit to outside and a second device that includes an installation unit configured to install the edge-server function program by using the installation data transmitted from the first device. The second device selects one or more registration candidate devices by comparing first information that is further included in the installation data and second information that is acquirable separately from the installation data and attempts to register the one or more registration candidate devices as data collection targets when installation of the edge-server function program is completed by the installation unit.
    Type: Grant
    Filed: September 4, 2019
    Date of Patent: August 2, 2022
    Assignee: FUJIFILM Business Innovation Corp.
    Inventor: Tomoka Nakagawa
  • Patent number: 11372860
    Abstract: A query directed at a table organized into a set of batch units is received. The query comprises a predicate for which values are unknown prior to runtime. A set of values for the predicate are determined based on the query. An index access plan is created based on the set of values. Based on the index access plan, the set of batch units are pruned using a pruning index associated with the table. The pruning index comprises a set of filters that index distinct values in each column of the table. The pruning of the set of batch units comprises identifying a subset of batch units to scan for data that satisfies the query. The subset of batch units of the table are scanned to identify data that satisfies the query.
    Type: Grant
    Filed: August 31, 2021
    Date of Patent: June 28, 2022
    Assignee: Snowflake Inc.
    Inventors: Max Heimel, Ismail Oukid, Linnea Passing, Stefan Richter, Juliane K. Waack
  • Patent number: 10628063
    Abstract: A method and device generates a slab identifier and a hash function identifier in response to a memory allocation request with a request identifier and allocation size from a memory allocation requestor. The slab identifier indicates a memory region associated with a base data size and the hash function identifier indicates a hash function. The method and device provides a bit string including the slab identifier and the hash function identifier to the memory allocation requestor.
    Type: Grant
    Filed: August 24, 2018
    Date of Patent: April 21, 2020
    Assignee: Advanced Micro Devices, Inc.
    Inventor: Alexander Dodd Breslow
  • Patent number: 10346181
    Abstract: Methods and systems are disclosed where a plurality of precompiled hardware templates are stored in memory, each of the hardware templates being configured for loading onto a re-configurable logic device such as a FPGA to define a data processing operation to be performed by the re-configurable logic device, each of the data processing operations defined by the precompiled hardware templates having an associated performance characteristic. A processor selects a precompiled hardware template from a plurality of the precompiled hardware templates in the memory for loading onto the re-configurable logic device based at least in part on the associated performance characteristics of the data processing operations defined by the precompiled hardware templates.
    Type: Grant
    Filed: January 29, 2018
    Date of Patent: July 9, 2019
    Assignee: IP Reservoir, LLC
    Inventors: Roger D. Chamberlain, Mark Allen Franklin, Ronald S. Indeck, Ron K. Cytron, Sharath R. Cholleti
  • Patent number: 10296497
    Abstract: In an embodiment, a first key value is received. A plurality of candidate rows are found in a database table, wherein the plurality of candidate rows are deleted. For the plurality of candidate rows, a plurality of respective impacts on a plurality of respective densities of each of other key values that are stored within a first key range of the first key value are calculated. For the plurality of candidate rows, a plurality of function results of the plurality of respective impacts on the plurality of respective densities are calculated. A selected candidate row of the plurality of candidate rows with a smallest function result of the plurality of function results of the plurality of respective impacts on the plurality of respective densities is selected. The first key value is stored to the selected candidate row.
    Type: Grant
    Filed: February 15, 2016
    Date of Patent: May 21, 2019
    Assignee: International Business Machines Corporation
    Inventors: Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras, Mark W. Theuer
  • Patent number: 10176051
    Abstract: A method, article of manufacture, and apparatus for processing data. In some embodiments, this includes analyzing a first container at a block level, determining a first level of granularity based on the analysis of the first container, based on the first level of granularity, identifying a first set of data objects, storing metadata of the first set of data objects in a recovery catalog, based on the first set of data objects, identifying a second container, analyzing the second container at a block level, determining a second level of granularity based on the analysis of the second container, based on the second level of granularity, identifying a second set of data objects, storing metadata of the second set of data objects in the recovery catalog, wherein the recovery catalog is stored in a storage device.
    Type: Grant
    Filed: July 14, 2016
    Date of Patent: January 8, 2019
    Assignee: EMC IP Holding Company LLC
    Inventors: Michael John Dutch, Christopher Hercules Claudatos, Mandavilli Navneeth Rao
  • Patent number: 9870382
    Abstract: A data structure and method of accessing, modifying, and adding data in the data structure are provided. The data structure includes an encoding dictionary, a decoding dictionary, and an attribute vector. The attribute vector includes information for cross-referencing characteristics associated with the same entry. Responsive to an instruction to add data, the method adds data to the encoding and decoding dictionaries as an entry and assigns a valueID for the added entries. The method then adds the valueID to attribute vector(s) associated with the dictionaries. Responsive to a query for data associated with a value, the method searches for the value in an encoding dictionary, determines a valueID corresponding to the data based on a match in the encoding dictionary, uses the attribute vector to find all relevant data across all dictionaries and attribute vectors, assembles the retrieved information in a tuple, then outputs all data associated with the value.
    Type: Grant
    Filed: March 25, 2014
    Date of Patent: January 16, 2018
    Assignee: SAP SE
    Inventor: Mohamad El-Ali
  • Patent number: 9575954
    Abstract: A dictionary data structure is described. The data structure is made up of first, second, and third tables. The first table is comprised of entries each representing a natural language term, each entry of the first table containing a term ID identifying its term. The second table is comprised of entries each representing a definition, each entry of the second containing a definition ID identifying its definition. The third table is comprised of entries each representing correspondence between a terminate definition defining the term, each entry of the third table containing term ID identifying the defined term and a definition ID identifying the defining definition. The contents of the data structure are usable to identify any definitions corresponding to a term.
    Type: Grant
    Filed: December 8, 2015
    Date of Patent: February 21, 2017
    Assignee: Unified Compliance Framework (Network Frontiers)
    Inventors: Dorian J. Cougias, Matthew Zulch, Vicki McEwen, Erwin Rydell, Erik Granlund, Steven Piliero
  • Publication number: 20140081979
    Abstract: Exemplary embodiments provide various techniques for the creation and access of quota trees in a file system. In one example, a method of identifying metadata referenced by a quota tree is provided. A quota tree metafile is accessed, and this quota tree metafile includes references to locations of inode grouped data structures associated with quota trees. Here, each quota tree is allocated an inode grouped data structure. A reference to a location of an inode grouped data structure that is allocated to the quota tree is identified from the quota tree metafile. The inode grouped data structure is accessed based on the reference, and this inode grouped data structure defines a set of inode identifiers associated with the quota tree.
    Type: Application
    Filed: August 5, 2011
    Publication date: March 20, 2014
    Applicant: NetApp, Inc.
    Inventor: Niranjan Pn
  • Patent number: 8572140
    Abstract: An input lookup key is hashed and the hashed key divided into stride bits into a multi-level Trie structure. A compression function logically combines the stride bits to generate the compressed index bits into the stride tables. The bucket in the last stride table found by the hashed key may have several keys that collide at the same hash value. Discriminant bits are read from the key and select a stored key in the bucket table for verification of its result. Since the hashed key is a compression of the longer input key, more information is contained per bit of the hashed key than in the long key. The multi-stride lookup is performed first on the hashed key, allowing a faster convergence to the lookup result. The first stride can index a single hash table, with the remaining hash bits and discriminant bits used to select from among colliding keys.
    Type: Grant
    Filed: October 1, 2010
    Date of Patent: October 29, 2013
    Assignee: X-Engines, Inc.
    Inventor: Millind Mittal
  • Publication number: 20130060780
    Abstract: In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.
    Type: Application
    Filed: September 2, 2011
    Publication date: March 7, 2013
    Inventors: Tirthankar Lahiri, Chi-Kim Hoang, Dina Thomas, Kirk Meredith Edson, Subhradyuti Sarkar, Mark McAuliffe, Marie-Anne Neimat, Chih-Ping Wang
  • Patent number: 8296296
    Abstract: Method and apparatus for formatting information within a directory tree structure into an encyclopedia-like entry. The method includes performing a search by utilizing a selective one or more search methodologies including keyword search, hierarchical search, dichotomous key search, and parametric search to correlate a search criteria to a searchable database for generating one or more matching items, wherein the searchable database is formatted in the directory tree structure. The directory tree structure includes nodes comprising a collection of related data and branches comprising links between the nodes. Each matching item represents a node from within the directory tree structure. The method further includes selecting one of the matching items, formatting the collection of related data corresponding to the node of the selected matching item into an encyclopedia-like entry, and displaying the encyclopedia-like entry corresponding to the node of the selected matching item.
    Type: Grant
    Filed: May 23, 2010
    Date of Patent: October 23, 2012
    Assignee: Gamroe Applications, LLC
    Inventor: Robert Olan Keith, Jr.
  • Publication number: 20120179689
    Abstract: Directory tree searching uses a path index to determine a set of documents tor a directory path portion of a search query. The set of documents for the directory path portion is evaluated with a set of document for an indexed term portion of the search query to determine common documents.
    Type: Application
    Filed: January 13, 2012
    Publication date: July 12, 2012
    Inventors: John M. Hornkvist, Eric R. Koebler
  • Publication number: 20120150861
    Abstract: Answers to search queries are identified and highlighted in search result snippets for documents containing the answers. When a user submits a search query to a search engine, the search engine may query a search index to identify a set of documents as relevant search results for the search query. Additionally, an answer data store may be queried to determine if there is a short answer to the search query. If an answer is found, the answer may be used when generating search result snippets. As such, the search result snippets for documents containing the answer may include the answer. The answer may also be highlighted in the search result snippets.
    Type: Application
    Filed: December 10, 2010
    Publication date: June 14, 2012
  • Publication number: 20120109954
    Abstract: Data for items of information are marked, stored and retrieved. A method for marking, storing and retrieving data for items of information. Markable data is received at an electronic device. The received markable data is marked using an input of the electronic device dedicated to selectively marking received markable data at the discretion of a user of the electronic device. The received marked data is stored as marked data in response to marking the received information. The stored marked data is retrieved using the electronic device. The stored marked data is obtained and presented.
    Type: Application
    Filed: October 27, 2010
    Publication date: May 3, 2012
    Inventor: Scott WHITE
  • Publication number: 20120096035
    Abstract: A system and method of conveying offers to a user in which at least one company is registered in a database on a first computer server and offering software is installed on a computer of the company. The offering software calculates a discount offer to be offered by the company and sends it to the first computer server, via a communication system. The method of the invention also includes installing monitoring software on a second computer server, so that the first computer server can monitor search queries of users received by the second computer server. When a search query sent by a user to the second computer server matches an offer stored on the first computer server, the matching offer is automatically sent to the second computer server via the communication system. This offer is then sent to the user who sent in the matching search query.
    Type: Application
    Filed: December 15, 2010
    Publication date: April 19, 2012
    Inventor: Donald Spector
  • Publication number: 20120078984
    Abstract: The present invention pertains to a method enabling a user to process data generated by multiple separate devices, the data being stored as a data file in a directory corresponding to each device, the method comprising initiating processing of the data, the user selecting multiple data files from one or more directories corresponding to the one or more devices, to form a set of data files without actually loading any of the data files, providing the user with an option to preview one or more of the selected data files of the set on a display, and after the user has confirmed the selection of data files forming the said set, automatically loading the selected data files from the said one or more directories, and processing the data present in the selected data files to obtain a processed result.
    Type: Application
    Filed: September 26, 2011
    Publication date: March 29, 2012
    Inventors: Jos Hendriks, Ron Niessen
  • Publication number: 20120041965
    Abstract: A device may receive a packet, determine a content identifier of the packet, identify a first processing device that has processed part of content associated with the content identifier, send the packet to the first processing device when the first processing device is identified, select a second processing device among a plurality of processing devices when the first processing device is not identified, and send the packet to the second processing device.
    Type: Application
    Filed: August 10, 2010
    Publication date: February 16, 2012
    Inventors: Juan Vasquez, Prashant Desai
  • Publication number: 20120030245
    Abstract: A database management system stores data form a plurality of logical tables as independent copies in different format. In one specific example the system organizes tables into table groups and de-normalizes the table in each table group. It also organizes data in a second format including vertical column containers that store all the data for one attribute, there being one column container for each table and each attribute within that table. The receipt of a query causes the system to develop a query plan that can interact with either or both of the container sets.
    Type: Application
    Filed: June 4, 2011
    Publication date: February 2, 2012
    Inventor: Ori Herrnstadt
  • Publication number: 20120023105
    Abstract: A worldwide mobile computing apparatus and database of race events indexed for mobile applications used on Smart phones, computers and computer peripherals for customers and enhanced with a proprietary news magazine, online and in print, and promoted with “AppWear” clothing and consumer goods.
    Type: Application
    Filed: July 5, 2011
    Publication date: January 26, 2012
    Inventor: Robert Tad Heydenfeldt
  • Publication number: 20110289104
    Abstract: The present application discloses a method for initiating an external search from a mobile device. The method involves determining that a search term entered into a user interface on the mobile device was not found in a search of data stored on a first memory on the mobile device and requesting the external search be conducted based on the search term for data stored on a second memory, which is external to the mobile device. Other aspects include a mobile device and computer-readable medium configured for implementing the method described above.
    Type: Application
    Filed: August 12, 2010
    Publication date: November 24, 2011
    Inventor: Robert WATT
  • Publication number: 20110282883
    Abstract: An indexing server of a P2P network and a method therefor are provided. The indexing server comprises: a metadata storage unit, which stores one or more entries, each of which is associated with a data file and includes a plurality of information items each indicating a node offering the data file and a location of the node; and a node information managing unit, which monitors the metadata storage unit to identify an entry stored in the metadata storage unit in which the number of information items exceeds a threshold, and transfers a portion of the information items included in the identified entry to another server, the transferred portion including as many as possible such information items that indicate nodes whose locations are close to each other.
    Type: Application
    Filed: March 26, 2010
    Publication date: November 17, 2011
    Applicant: NEC (CHINA) CO., LTD.
    Inventors: Yongqiang Liu, Yong Xia, Yan Hu, Quan Huang
  • Publication number: 20110282884
    Abstract: A method and a device for recording media are provided. The method includes performing a media recording process. During the media recording process, periodically media index information are generated according to currently written media chunks. The generated media index information is saved.
    Type: Application
    Filed: June 30, 2011
    Publication date: November 17, 2011
    Applicant: Huawei Device Co., LTD.
    Inventor: Tao Ma
  • Publication number: 20110270842
    Abstract: A computer-implemented method includes receiving a selection of a particular logical field via a database query interface. The method includes querying a discovery registry associated with a data abstraction model of a database to discover one or more web services that are resolvable based on the particular logical field. The data abstraction model includes a plurality of logical fields, where each logical field corresponds to a particular data structure of the database. A web service input and a web service output of a particular discovered web service are associated with logical fields of the data abstraction model via the discovery registry. A modified database query interface includes an input assistance selectable input associated with the discovered web services. In response to a selection of the input assistance selectable input, a form input interface may be displayed that includes one or more input forms associated with the discovered web services.
    Type: Application
    Filed: April 30, 2010
    Publication date: November 3, 2011
    Inventors: Richard D. Dettinger, Frederick A. Kulack, Kevin G. Paterson, Shannon E. Wenzel
  • Publication number: 20110246547
    Abstract: Methods and apparatus for device applet management on smart cards. A method includes obtaining device applets at a first device, generating a directory structure that identifies platform types and corresponding device applets, and storing the device applets in the directory structure on a smart card so that when the smart card is in communication with a second device supporting a selected platform, device applets associated with the selected platform are accessible to the second device. An apparatus includes a transceiver to obtain device applets at a first device, and a processor generate a directory structure that identifies platform types and corresponding device applets, and stores the device applets in the directory structure on a smart card so that when the smart card is in communication with a second device supporting a selected platform, device applets associated with the selected platform are accessible to the second device.
    Type: Application
    Filed: March 30, 2010
    Publication date: October 6, 2011
    Applicant: QUALCOMM Incorporated
    Inventors: Nakul Duggal, Bryan Chuck Gurganus, Carl Qu
  • Publication number: 20110225164
    Abstract: This patent application relates to granular and workload driven database index defragmentation techniques. These techniques allow for defragmenting individual index ranges, performing benefit analyses to estimate the impact of defragmenting indexes or index ranges, and leveraging such benefit analyses to provide automated workload-driven recommendations of index(es) or index range(s) to defragment.
    Type: Application
    Filed: March 14, 2010
    Publication date: September 15, 2011
    Applicant: Microsoft Corporation
    Inventors: Vivek Narasayya, Manoj Syamala
  • Publication number: 20110196905
    Abstract: Described herein are method and apparatus for storing data to a low-latency random read memory (LLRRM) device using non-aligned data striping, the LLRRM device being implemented on a storage system. The LLRRM device may comprise a bank comprising a plurality of memory chips, each chip being simultaneously accessible for storing data on a plurality of erase-units (EUs). A storage operating system may maintain, for each chip, a reserve data structure listing reserve EUs and a remapping data structure for tracking remappings between defective EUs to reserve EUs in the chip. A defective EU in a chip may be mapped to a reserve EU from the reserve data structure. Upon receiving a data block to be stored to the LLRRM device at the defective EU, the storage operating system may stripe the received data block across a plurality of chips in a non-aligned manner using the remapped reserve EU.
    Type: Application
    Filed: April 15, 2011
    Publication date: August 11, 2011
    Inventors: Jeffrey S. Kimmel, Rajesh Sundaram, George Totolos, JR., Michael W.J. Hordijk
  • Publication number: 20110191598
    Abstract: There is provided a first dock for a portable hard disk, where the first dock is connectable to a host device. There is also provided a corresponding method for accessing content on the host device during use of the dock. It is advantageous that the host device is able to access content from portable hard disks that are docked with the first dock and a second dock.
    Type: Application
    Filed: February 1, 2010
    Publication date: August 4, 2011
    Inventors: Wong Hoo Sim, Paul Pontin, Simon Lee, Yew Teng Too
  • Patent number: 7941605
    Abstract: Methods and apparatus are disclosed for generating a result based on a lookup result from a lookup operation using an associative memory and processing based on a discriminator portion of a lookup word. A first lookup operation is performed to generate a lookup result. In one implementation, a second lookup operation is performed based on a discriminator or the lookup result depending on the result of an evaluation, such as whether there was a hit or the lookup result matches a predetermined value. In one implementation, a second lookup operation is performed based on the discriminator, and either the result of the first or second lookup operation is used for subsequent processing. One implementation performs a lookup operation based on a lookup word to generate a lookup result, which is used to retrieve a base address and a bitmap from a memory.
    Type: Grant
    Filed: November 1, 2002
    Date of Patent: May 10, 2011
    Assignee: Cisco Technology, Inc
    Inventors: Eyal Oren, Oded Trainin, Gil Goren
  • Publication number: 20110082866
    Abstract: A lookup table provides a longest prefix match for a search key longer than a lookup table's mapper key. The lookup table performs a multi-level search in one or more mappers for the result value based on a portion of the search key provided as the mapper key. The lookup table is searched in multiple passes with successive portions of the search key until the result value is found.
    Type: Application
    Filed: June 21, 2001
    Publication date: April 7, 2011
    Inventor: David A. Brown
  • Publication number: 20110078108
    Abstract: Tools and techniques for collecting data from target systems without the need for installation of expensive and high-maintenance software agents on the target systems. In some cases, these tools can be used to collect performance data from collection targets while still allowing the operator(s) of the collection targets to govern the access of the tools, alleviating security concerns. Merely by way of example, certain tools employ data collection scripts, which may be analyzed by the collection target against security policies of that collection target, to ensure that the scripts will not take any actions that might violate such security policies. Other tools may be used to collect data in real time by transmitting a script for immediate execution by the host system, which could then return the data produced by the script immediately upon completion (and/or as part of execution of the script).
    Type: Application
    Filed: September 29, 2010
    Publication date: March 31, 2011
    Applicant: Oracle International Corporation
    Inventor: Arun N. Kumar
  • Publication number: 20110078150
    Abstract: A method comprises receiving a plurality of emails. Each of the plurality of emails comprises message information and header information. The header information comprises subject information and one or more email addresses. The method further comprises generating filtered email data comprising email addresses by at least filtering message information and subject information from each of the plurality of emails. The method further comprises correlating sender information and recipient information in the filtered email data, the correlation based at least in part on the one or more email addresses. The method further comprises storing in memory one or more email addresses from the filtered email data.
    Type: Application
    Filed: June 4, 2010
    Publication date: March 31, 2011
    Applicant: Bank of America Corporation
    Inventors: Tamer Rashad, Kenneth Brady, Kenny Keung Sing Lee, Jillian Moo-Young, Sapna Vyas
  • Publication number: 20110016103
    Abstract: A data tag descriptor method and system. The method includes generating by a device, a request for media data. The device generates a globally unique data tag specifying capabilities of the device and a transmission package comprising the request and the globally unique data tag. The device transmits the transmission package to a service provider. The service provider determines based comparing the globally unique data tag to a media tag associated with metadata describing the media data if the media data is compatible with the capabilities of the device. The device receives executable media data from the service provider. The executable media data comprises a specified form of the media data. The executable media data is generated based on results of determining if the media data is compatible with the capabilities of said device. The device executes the executable media data for a user.
    Type: Application
    Filed: July 14, 2009
    Publication date: January 20, 2011
    Inventors: Gandhi Sivakumar, VijayaGanesh Subramanian
  • Publication number: 20100241632
    Abstract: In general, the invention relates to supporting multiple different character encodings in the same file system. In one embodiment, a method is provided for filename lookup that supports multiple character encodings. The method comprises storing filename data in a first character encoding into an indexed data structure. The method further comprises receiving filename data in a second encoding. The method also comprises looking up filename data in the indexed data structure using the second encoding.
    Type: Application
    Filed: June 4, 2010
    Publication date: September 23, 2010
    Inventors: Eric M. Lemar, Nathan N. White
  • Publication number: 20100228716
    Abstract: An apparatus includes a generation unit configured to generate an address to be provided to a database, a plurality of search units, and a processing unit configured to perform a network protocol processing based on a search result, wherein the search units, including an input unit configured to input a search key, a comparison unit configured to compare data output from the database and the search key input, a setting unit configured to set a search start address and a search end address, and a monitoring unit configured to monitor matching of the generated address and the search end address.
    Type: Application
    Filed: March 4, 2010
    Publication date: September 9, 2010
    Inventor: Kazuhiko Morimura
  • Publication number: 20100153184
    Abstract: According to one aspect of the present disclosure a method and technique for predictive modeling of customer behavior is disclosed. The method includes receiving customer data from a plurality on non-affiliated vendor properties, anonymizing at least a portion of the received customer data and merging the anonymized customer data from each vendor property into a consortium database, and generating at least one predictive model of at least one behavior variable associated with at least one customer represented in the consortium database, the predictive model enabling identification of at least one stimuli likely to affect a desired response by the customer based on the predictive model.
    Type: Application
    Filed: November 17, 2009
    Publication date: June 17, 2010
    Applicant: STICS, Inc.
    Inventors: Andrew J. Caffrey, Karen C. Joiner-Congleton
  • Publication number: 20100094889
    Abstract: A system and method for performing non-binary comparison of biological sequences includes a new measure ?0, which is a non-binary counting measure that is used in a stand alone module called VaSSA-1. This measure obtains substantially more information about sequences and comparisons between them than is gathered by conventional bioinformatics techniques.
    Type: Application
    Filed: December 9, 2009
    Publication date: April 15, 2010
    Inventor: Jeffrey M. CLARK
  • Publication number: 20100011028
    Abstract: A system and methods of managing entries in a cuckoo hash table that is subject to manipulation by a plurality of concurrent processors are provided. The cuckoo hash table is used to maintain a plurality of keys, along with their data items, in a plurality of entries. In accordance with an operating method, a first command for the cuckoo hash table is processed, and the first command is associated with a first processor of the plurality of concurrent processors. In addition, invalid conditions associated with concurrent processing of a second command for the cuckoo hash table are prevented or minimized. The second command is associated with a second processor of the plurality of concurrent processors. As one example, the operating method manages the situation where concurrent push commands create a race condition. As another example, the operating method manages the situation where a lookup or delete command from one processor competes with a push command from another processor.
    Type: Application
    Filed: July 14, 2008
    Publication date: January 14, 2010
    Inventor: Nicolas Sebastien DADE
  • Patent number: 7617225
    Abstract: Systems and methods for managing data are provided. Data such as metadata from files created by several different software applications are captured, and the captured metadata is searched. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. A single search input is received and the search is performed through the metadata and content of the plurality of files and subset of the plurality of files stored on a user's data processing system. The search input is saved in a folder for performing future searches.
    Type: Grant
    Filed: January 31, 2006
    Date of Patent: November 10, 2009
    Assignee: Apple Inc.
    Inventors: Yan Arrouye, Dominic Giampaolo, Bas Ording, Gregory Christie, Stephen Olivier Lemay, Marcel van Os, Imran Chaudhri, Kevin Tiene, Pavel Císler
  • Publication number: 20090275881
    Abstract: Peritoneal dialysis therapy outcomes have been calculated for a variety of dwell times of peritoneal dialysis fluids in the peritoneal cavities of dialysis patients using kinetic modeling. The length of dwell time should not be the same for every patient, but should vary according to the patient condition and needs. Some patients have a potential for expressing greater ultrafiltrate into the dialysis fluid, and these patients can benefit from a longer dwell time, whereas other patients with less potential will not benefit from a longer dwell time. An optimal or peak time is observed for each peritoneal dialysis therapy outcome, such as ultrafiltrate volume rate, urea clearance (Kt/V), and creatinine clearance, while minimizing hydrocarbon absorption. These values and input parameters can be used to tailor the peritoneal dialysis dwell time for each patient, estimating the peak dwell time that will yield the best therapy outcome for each patient.
    Type: Application
    Filed: April 28, 2009
    Publication date: November 5, 2009
    Inventors: Ying-Cheng Lo, Alp Akonur, Isaac Martis
  • Publication number: 20090276440
    Abstract: A practical distributed computing system with almost perfect scalability is realized by distributed has table like search and lookup algorithm implemented in a hardware P2P (peer-to-peer) overlay with multiple P2P software overlays. Each software overlay is implemented as an active database. Each hardware overlay node is any IP device, fixed or mobile; while the system can be implemented with or without a server infrastructure. This system is adapted to multiple applications: multi-player gaming, file sharing within a closed user group, media session handover, event trigger, and behavior-based marketing.
    Type: Application
    Filed: April 29, 2009
    Publication date: November 5, 2009
    Inventor: Wei Kang Tsai
  • Publication number: 20090248627
    Abstract: A system and method are disclosed for rewriting queries. The queries may be rewritten into a bid phrase for identifying search results and/or advertisements. The bid phrase may be a keyword that is purchased for sponsored searching. A mapping between potential queries and bid phrases may be generated. The mapping may be referenced upon receiving a search query for identifying a query rewrite with a bid phrase for that search query. The mapping may be generated in preprocessing.
    Type: Application
    Filed: March 27, 2008
    Publication date: October 1, 2009
    Applicant: YAHOO! INC.
    Inventors: Ben Shahshahani, Vanja Josifovski, Evgeniy Gabrilovich, Andrei Broder, Filip Radlinski
  • Publication number: 20090204607
    Abstract: When registering a document, pieces of index candidate information to be assigned to the document to be registered are created and output based on user characteristic information acquired from login information of a user and document information acquired from the document to be registered. Index information selected by the user from the pieces of output index candidate information is received. The received index information is registered in association with the document acquired by a document information acquiring unit. When browsing a document, the user characteristic information acquired from the login information of the user is compared with user characteristic information set for the registered document in association with the index information. A document having user characteristic information whose predetermined items match items of the set user characteristic information is extracted as a document associated with the user.
    Type: Application
    Filed: February 4, 2009
    Publication date: August 13, 2009
    Inventor: Noriko Matsuzawa
  • Publication number: 20090132575
    Abstract: A method and system of masking a group of related data values. A record in an unmasked data file of n records is read. The record includes a first set of data values of data elements included in a related data group (RDG) and one or more data values of one or more data elements external to the RDG. A random number k is received. A second set of data values is retrieved from a lookup table that associates n key values with n sets of data values. Retrieving the second set of data values includes identifying that the second set of data values is associated with a key value of k. The n sets of data values are included in the umnasked data file's n records. The record is masked by replacing the first set of data values with the retrieved second set of data values.
    Type: Application
    Filed: November 19, 2007
    Publication date: May 21, 2009
    Inventors: William Kroeschel, Arvind Sathi, Mahesh Viswanathan
  • Publication number: 20090055379
    Abstract: Systems and methods for locating contact information are shown and described. The method can include receiving an instruction to locate a portion of contact information stored in the one or more directories of the computing device and initiating a plurality of directory handler routines at the computing device. Each directory handler routine can be associated with a specific one of the directories of the computing device. The method also includes traversing one or more of the directories resident at the computing device with the associated directory handler routine and locating the contact information stored in the one or more directories. Also, the method includes aggregating the located contact information and displaying the aggregated contact information at the computing device.
    Type: Application
    Filed: August 22, 2007
    Publication date: February 26, 2009
    Inventor: Richard Murtagh
  • Publication number: 20090030878
    Abstract: A system and method for generating user-centric directories including analyzing a plurality of relationships of a user. A contact directory for the user is defined based upon the plurality of relationships of the user.
    Type: Application
    Filed: July 25, 2007
    Publication date: January 29, 2009
    Inventors: Robert Cameron Weir, Barry E. Willner, Patrick Joseph O'Sullivan, Edith Helen Stern
  • Publication number: 20080243793
    Abstract: A contact information function associated with a web browser maintains a look-up table of recognizer functions, indexed by regular expressions that specify URLs. Upon a user entering or selecting a URL, the contact information function indexes the look-up table with the URL against the regular expressions. If one or more recognizers are found, the web content returned from the URL is processed by each of the recognizers, which recognize the format of information on that web site, and locate and extract contact information from the web content. The contact information may be saved, formatted, and output to other applications. Updated recognizers may be downloaded from a recognizer server.
    Type: Application
    Filed: March 20, 2008
    Publication date: October 2, 2008
    Inventors: Paul Hallett, Fernando Martins, Calvin Li, Ning Li