Trees, E.g., B+ Trees, Etc. (epo) Patents (Class 707/E17.05)
  • Patent number: 8965911
    Abstract: Nodes in a tree data structure are associated with respective node keys. At least some of the nodes are associated with at least one respective node rank. The structure is searched to attempt to identify a preferred prefix-matching node on the basis of attempting to find a prefix-matching node that has a prefix match with a search key and which has a preferred node rank relative to a node rank associated with a node which may have a longer prefix match. If the prefix-matching node is identified, a dependent node rank identifier associated with the prefix-matching node is used to determine that the prefix-matching node has the preferred node rank. The dependent node rank identifier indicates at least a node rank of a node which may have a longer prefix match than the prefix-matching node. The prefix-matching node is selected, if identified, as a preferred prefix-matching node.
    Type: Grant
    Filed: September 28, 2012
    Date of Patent: February 24, 2015
    Assignee: Metaswitch Networks Ltd
    Inventor: Adam Dinwoodie
  • Patent number: 8543613
    Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.
    Type: Grant
    Filed: March 6, 2012
    Date of Patent: September 24, 2013
    Assignee: International Business Machines Corporation
    Inventor: Vilho T. Raatikka
  • Patent number: 8527546
    Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.
    Type: Grant
    Filed: August 31, 2011
    Date of Patent: September 3, 2013
    Assignee: International Business Machines Corporation
    Inventor: Vilho T. Raatikka
  • Publication number: 20130046792
    Abstract: A hybrid object tree that interconnects individual data objects of different data types from a group of different input data sources is provided. The instantiated data objects of the hybrid object tree include an internal dynamic data area that encapsulates at least one reference to an original input data source. At least one attribute is identified that is unavailable at the referenced original input data source of a first instantiated data object of the hybrid object tree. The at least one attribute is added to the first instantiated data object of the hybrid object tree within the internal dynamic data area of the first instantiated data object.
    Type: Application
    Filed: August 18, 2011
    Publication date: February 21, 2013
    Applicant: International Business Machines Corporation
    Inventor: Arthur L. De Magalhaes
  • Publication number: 20120323931
    Abstract: A request may be received that includes an indicator associated with a geographic location and scope. A database search may be initiated, based on the geographic location and scope. A list of one or more tags may be received, the tags associated with the geographic location, ordered based on relevance within the geographic scope, based on tag locale rankings associated with each of the tags included in the list of tags, the tag locale rankings based on comparisons of relative frequencies of occurrence of the tags, based on first bounded geographic areas, compared with second relative frequencies of occurrence of the tags based on second bounded geographic areas that are respectively larger than the first bounded geographic areas, the request geographic scope indicating one of a plurality of hierarchical geographic analysis levels associated with a plurality of geographic locations.
    Type: Application
    Filed: June 17, 2011
    Publication date: December 20, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Daniel Buchmueller, Michael Kroepfl, Frederik Schaffalitzky
  • Publication number: 20120317107
    Abstract: This invention relates to determining page elements to display in response to a search. A method embodiment of this invention determines a page element based on a search result. The method includes: (1) determining a set of result classifications based on the search result, wherein each result classification includes a result category and a result score; and (2) determining the page element based on the set of result classifications. In this way, a classification is determined based on a search result and page elements are generated based on the classification. By using the search result, as opposed to just the query, page elements are generated that corresponds to a predominant interpretation of the user's query within the search results. As result, the page elements may, in most cases, accurately reflect the user's intent.
    Type: Application
    Filed: January 23, 2012
    Publication date: December 13, 2012
    Applicant: GOOGLE INC.
    Inventors: Tania Bedrax-Weiss, Ramanathan Guha, Patrick Riley, Corin Anderson
  • Patent number: 8234233
    Abstract: A system and method to integrate breadth-first and depth-first strategies in a single search technique or routine is provided. It combines the complementary strengths of both strategies to achieve significantly improved speed over either strategy used alone. The new algorithm can be used to efficiently find solutions to the treewidth problem that has applications in areas such as diagnosis using probabilistic inferences.
    Type: Grant
    Filed: April 13, 2009
    Date of Patent: July 31, 2012
    Assignee: Palo Alto Research Center Incorporated
    Inventor: Rong Zhou
  • Publication number: 20120143919
    Abstract: A method for storing XML documents a hybrid navigation/streaming format is provided to allow efficient storage and processing of queries on the XML data that provides the benefits of both navigation and streaming and ameliorates the disadvantages of each. Each XML document to be stored is independently analyzed to determine a combination of navigable and streamable storage format that optimizes the processing of the data for anticipated access patterns.
    Type: Application
    Filed: December 6, 2010
    Publication date: June 7, 2012
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Sam Idicula, Balasubramanyam Sthanikam, Nipun Agarwal
  • Publication number: 20120143920
    Abstract: Various embodiments of systems and methods for dynamically weighted semantic trees are described herein. One or more software elements of a hierarchy are identified in response to user actions in a report. The user actions are related to at least one software element of the one or more software elements of the hierarchy. A local tree is constructed for each user by assigning local weights for the one or more software elements based on user visits to the one or more software elements. A group tree is constructed for each group to which the users belong by assigning group weights for the one or more software elements based on the user visits to the one or more software elements. The local tree and the global tree are stored for use in various applications.
    Type: Application
    Filed: December 6, 2010
    Publication date: June 7, 2012
    Inventors: DEVICHARAN VINNAKOTA, ANIL BABU ANKISETTIPALLI, SURESH PASUMARTHI
  • Publication number: 20120136901
    Abstract: Additional information is provided in a checkpoint image such that direct pointers can be included in the checkpoint image. Thus, an in-memory database management system can be restored from the checkpoint image in the event of a failure without causing any significant performance drawbacks to the database management system.
    Type: Application
    Filed: August 31, 2011
    Publication date: May 31, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Vilho T. Raatikka
  • Publication number: 20120136874
    Abstract: Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index.
    Type: Application
    Filed: November 30, 2010
    Publication date: May 31, 2012
    Applicant: Teradata US, Inc.
    Inventor: Gregory Howard Milby
  • Publication number: 20120136868
    Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.
    Type: Application
    Filed: November 30, 2010
    Publication date: May 31, 2012
    Inventors: Beda Hammerschmidt, Zhen Hua Liu, Thomas Baby, Kongyi Zhou
  • Publication number: 20120072462
    Abstract: Data processing includes accessing a product category tree, the product category tree comprising a plurality of hierarchical levels. A leaf category level of the plurality of hierarchical levels comprises a leaf category node. The leaf category node includes product information. The product information comprises a plurality of product attribute parameters. The plurality of product attribute parameters comprises standard product information. Data processing further includes selecting, among the plurality of product attribute parameters that correspond to the leaf category node, a representative product attribute parameter that is representative of the product information; and partitioning standard product information of the leaf category node to obtain a plurality of sets using the representative product attribute parameter, wherein each of the plurality of sets includes at least some of the standard product information.
    Type: Application
    Filed: September 19, 2011
    Publication date: March 22, 2012
    Inventors: Haijie Gu, Ningjun Su, Qifeng Dai, Haiping Ma, Jinyin Zhang, Enhong Chen
  • Patent number: 8122064
    Abstract: A data sorting program that is capable of performing a data sorting process by using a small capacity of memory at a fast speed. A computer executing the data sorting program has the following functions. A concise ordered TRIE creator creates a root, sequentially reads the characters of each data, and when a prescribed number of data passed a certain node connected to the root before and a child node corresponding to a character next to a character associated with the certain node has not been created, creates the child node so that the child nodes of the certain node have a prescribed arrangement. A partition determination unit sets partitions between prescribed nodes. A data grouping unit groups the data into a plurality of data groups according to the partitions.
    Type: Grant
    Filed: December 17, 2007
    Date of Patent: February 21, 2012
    Assignee: Fujitsu Limited
    Inventors: Tatsuya Asai, Seishi Okamoto, Hiroki Arimura
  • Publication number: 20120016908
    Abstract: A volatile memory manager of a data handling system can be configured to convert the one-to-many external reference into an external reference that references the common ancestor node of the contiguous region. Specific pathing and/or termination conditions can be contained in a Relationship_Path parameter of the external reference. The hierarchical data structure can also be loaded into volatile memory by the volatile memory manager as data structure references. The volatile memory manager can be further configured to perform various functions utilizing the external and data structure references.
    Type: Application
    Filed: July 19, 2010
    Publication date: January 19, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: ANITA O. L. LEUNG, JOHN MOURRA, C. LORNE PARSONS, KEVIN QUAN, CRYSTAL J. SU, GRANT D. TAYLOR, HIROSHI TSUJI
  • Publication number: 20110313548
    Abstract: Event prediction using hierarchical event features is described. In an embodiment a search engine monitors search results presented to users and whether users click on those search results. For example, features describing the search result events are universal resource locator prefix levels which are inherently hierarchically related. In an embodiment a graphical data structure is created and stored and used to represent the hierarchical relationships between features. An online training process is used in examples which enables knowledge to be propagated through the graphical data structure according to the hierarchical relations between features. In an example, the graphical data structure is used to predict whether a user will click on a search result and those predictions are used by the search engine to rank search results for future searches. In another example the events are advertisement impressions and the predictions are used by an online advertisement system.
    Type: Application
    Filed: June 17, 2010
    Publication date: December 22, 2011
    Applicant: Microsoft Corporation
    Inventors: Michael J. Taylor, Vishwa Vinay, Yauhen Shnitko
  • Publication number: 20110238667
    Abstract: A system, method, and computer program product are provided for generating a range of ordinals corresponding to key values represented in a B-Tree data structure. This allows for a boundary point, usable, for example, for partitioning the B-Tree for parallel processing, to be specified using an ordinal value of the range of ordinals. Then an ordinal-to-key transformation can be performed in order to identify a key value corresponding to the boundary point. Additionally, ordinal values can be identified through the use of key-to-ordinal transformations, allowing for specification of ranges, for example, in terms of key values.
    Type: Application
    Filed: March 29, 2010
    Publication date: September 29, 2011
    Applicant: Sybase, Inc.
    Inventors: Kurt DESCHLER, Steven A. Kirk
  • Publication number: 20110238680
    Abstract: A method of decreasing a total computation time for a visual simulation loop includes sharing a common data structure across each phase of the visual simulation loop by adapting the common data structure to a requirement for each particular phase prior to performing a computation for that particular phase.
    Type: Application
    Filed: March 26, 2010
    Publication date: September 29, 2011
    Inventors: Jatin Chhugani, Bryan Catanzaro, Sanjeev Kumar, Changkyu Kim, Nadathur Rajagopalan Satish
  • Publication number: 20110213747
    Abstract: A method for allocating resources includes receiving one or more parameters associated with an object of interest. At least one of the parameters corresponds to a probability that the object of interest is participating in a predetermined situation of interest. The method also includes calculating a plurality of values, based at least in part on the parameters, and selecting, based at least in part on the calculated values, one or more operations to be performed involving the object of interest. In addition the method includes generating an instruction based at least in part on the operation to be performed transmitting the instruction to an operational resource.
    Type: Application
    Filed: February 26, 2010
    Publication date: September 1, 2011
    Applicant: Raytheon Company
    Inventors: David B. Siebecker, Barbara J. Blyth
  • Publication number: 20110202840
    Abstract: A broadcaster-specific service module is provided for applications hosted by a processing device. The broadcaster-specific service module and the applications communicate through a common service bus. The broadcaster-specific service module receives items from an online broadcaster via a network, with each item associated with a media file or stream available from the online broadcaster. The broadcaster-specific service module generates a catalog containing a tree of the items, and sends the catalog to a target application via the service bus to display the catalog for user selection. The broadcaster-specific service module formats data of the catalog can be understood by all of the applications attached to the service bus.
    Type: Application
    Filed: February 12, 2010
    Publication date: August 18, 2011
    Applicant: Red Hat, Inc.
    Inventor: Bastien R. D. Nocera
  • Publication number: 20110119311
    Abstract: A node thinning-out means 12 for carrying out a process of thinning out nodes constructing line segments included in map data, the nodes excluding branch points, according to a scale to be created which is smaller than a specific scale is disposed. A hierarchical graph component 13 groups the nodes on which the thinning-out process has not been performed yet and the nodes on which the thinning-out process has been performed by the node thinning-out unit 12 into hierarchical layers according to the scale, and creates connection destination information showing nodes to which each node belonging to each of the hierarchical layers is connected.
    Type: Application
    Filed: March 26, 2008
    Publication date: May 19, 2011
    Inventor: Kazuma Fukuda
  • Publication number: 20110119315
    Abstract: A method and apparatus for generating a statistical tree representing an extensible markup language Schema (XSD) is disclosed. Components of the XSD are prioritized according to predefined rules. A root node representing said XSD is created. Pairs of child nodes are generated from the root node. Each pair comprises at least one genuine node, and each pair of generated child nodes is appended to a parent node which is a genuine node. The path to each of said child nodes from a respective parent genuine node is represented with a binary sequence. At least one genuine node is allocated to a corresponding component of said XSD, the allocation being based on the prioritization of the component.
    Type: Application
    Filed: January 21, 2011
    Publication date: May 19, 2011
    Applicant: IBM CORPORATION
    Inventors: Rohit Shetty, Umesh Kumar Balaraj
  • Publication number: 20110093486
    Abstract: A relational database query system for a relational database is provided, wherein the relational database comprises several relational tables including at least one constant table storing several unique data. The relational database query system comprises a query receiving module for receiving an extensible-markup-language query (XML query); at least a constant mapping tree respectively corresponds to one of the at least constant tables, wherein the at least constant mapping tree comprises several tree nodes respectively with node numbers respectively corresponding to the unique data in the at least constant table; a query generator for converting the XML query to be a structured query language (SQL) query according to the at least constant mapping tree; a query module for querying the relational database with the SQL query.
    Type: Application
    Filed: March 3, 2010
    Publication date: April 21, 2011
    Applicant: INSTITUTE FOR INFORMATION INDUSTRY
    Inventors: Chuo-Yen Lin, Yung-Feng Lu, Pei-Lun Suei, Shih-Chun Chou, Tei-Wei Kuo
  • Publication number: 20110078124
    Abstract: An information creating apparatus creates a leaf page information including one or more records with a key information to be compared with a retrieval key information inputted for retrieval of a record. The apparatus creates, based on the key information of the record included in the leaf page information, a judgment information used to judge a possibility that the leaf page information located in a position of child of the node page information located between the root and leaf page informations, and in lower positions than it, includes the record to be retrieved with the retrieval key information, and creates the node page information including the judgment information. The apparatus creates the root page information including the judgment information included in the node page information located in the positions of the child of the root page information, and stores the root, node and leaf page informations in a tree structure.
    Type: Application
    Filed: March 22, 2010
    Publication date: March 31, 2011
    Applicant: BROTHER KOGYO KABUSHIKI KAISHA
    Inventor: Kentaro Ushiyama
  • Publication number: 20110016368
    Abstract: A method for auditing and verifying configuration items (CIs) in an information technology (IT) configuration management database (CMDB) includes identifying which configuration item (CI) types should be part of an audit, defining link rules to link an authorized CI type stored in a CMDB to an actual CI type that is part of an IT infrastructure, retrieving all authorized CI instances of the identified CI types from the CMDB, retrieving all actual CI instances of the identified CI types from a discovery upload of a current IT environment, comparing the actual CI instances to the authorized CI instances, and taking remedial action when variances are discovered.
    Type: Application
    Filed: July 14, 2009
    Publication date: January 20, 2011
    Applicant: International Business Machines Corporation
    Inventors: Naga A. Ayachitula, Melissa J. Buco, Bradford Austin Fisher, David Loewenstern, Larisa Shwartz, Christopher Ward
  • Publication number: 20100299152
    Abstract: In various embodiments, a method is described that includes registering a mobile device with an enterprise by storing registration data for the mobile device in a device management database; designating one or more group designations for the mobile device; storing the one or more group designations in the device management database; determining one or more policies for the mobile device based at least in part on the one or more group designations; and selectively taking action on selected data from the mobile device in the device management database based on the one or more policies.
    Type: Application
    Filed: May 20, 2009
    Publication date: November 25, 2010
    Applicant: Mobile Iron, Inc.
    Inventors: Suresh Kumar Batchu, Ajay Kumar Mishra
  • Publication number: 20100262574
    Abstract: A system and method to integrate breadth-first and depth-first strategies in a single search technique or routine is provided. It combines the complementary strengths of both strategies to achieve significantly improved speed over either strategy used alone. The new algorithm can be used to efficiently find solutions to the treewidth problem that has applications in areas such as diagnosis using probabilistic inferences.
    Type: Application
    Filed: April 13, 2009
    Publication date: October 14, 2010
    Applicant: Palo Alto Research Center Incorporated
    Inventor: Rong Zhou
  • Publication number: 20100257206
    Abstract: Organization and assignment of access privileges to resources in a computer network. The resources of the network are organized into a hierarchical tree structure, with each node in the tree representing a resource, resource group, or resource instance. Read and/or write permission to one or more resources may be explicitly granted to the resource or implicitly granted based upon the location of the resource in the hierarchical structure. The access rights attach to the resource(s). Upon movement of the resource within the tree structure or to an alternate tree structure, the access rights associated therewith remain with the relocated resource.
    Type: Application
    Filed: April 7, 2009
    Publication date: October 7, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Eric W. Brown, Ramamohan Chennamsetty, Kerry A. Ortega, Aaron D. Sahlin, Andrew J. Streit
  • Publication number: 20100250611
    Abstract: A method and apparatus for performing a paging operation on a tree having a plurality of nodes is provided. A preorder number and a subtree size are maintained in a machine-readable medium for each of the plurality of nodes of the tree. The preorder number associated with a particular node of the tree identifies a position for the particular node in a depth-first search ordering of the plurality of nodes of the tree. The subtree size associated with a particular node of the tree identifies a count of all the nodes in a subtree rooted at the particular node. In response to receiving a request to perform a paging operation on the plurality of nodes of the tree, a set of nodes that satisfy the paging operation may be determined using the preorder number and the subtree size associated with each node of the tree.
    Type: Application
    Filed: March 31, 2009
    Publication date: September 30, 2010
    Inventor: Sanjay Krishnamurthy
  • Publication number: 20100228783
    Abstract: A method for desensitizing character strings comprises ordering an original set of character strings and generating a tree structure that has nodes corresponding to the ordered set of sensitive strings. The sensitive characters on the nodes of the tree are then desensitized in depth-first order such that a set of desensitized strings is generated that preserves the ordering of the original sensitive set.
    Type: Application
    Filed: March 6, 2009
    Publication date: September 9, 2010
    Inventors: Maria G. Castellanos, Umeshwar Dayal, Bin Zhang
  • Publication number: 20100228734
    Abstract: The techniques presented herein are directed towards providing a user-directed keyword-based search on a large collection of XML documents, and displaying a summary of results to the user. Prior to receiving search requests from a user, an offline analysis of a large collection of XML documents is performed to construct an inverted index of keywords. For each keyword, the index stores a set of location indicators that identify all the instances of the keyword found in the collection of documents. A location indicator may comprise a document identifier, an indication of the position of the node in the hierarchy of nodes within the XML document containing the keyword, and an indication of the pathname of the node containing the keyword. Once the index is constructed, keyword searching can be done efficiently by a keyword lookup in the index.
    Type: Application
    Filed: February 24, 2009
    Publication date: September 9, 2010
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventor: Ravi Murthy
  • Publication number: 20100217569
    Abstract: A method for evaluating a device during circuit simulation includes receiving a first request including a first input value; and mapping the first input value to a first space in a table. The table is configured to store one or more table entries. A table entry includes an input value and a stored value. The stored value is obtained as a function of the input value from an analytical device model used to characterize the device during circuit simulation.
    Type: Application
    Filed: February 20, 2009
    Publication date: August 26, 2010
    Applicant: SUN MICROSYSTEMS, INC.
    Inventor: Alexander Korobkov
  • Publication number: 20100211308
    Abstract: Interesting location identification embodiments are presented that generally involve identifying and providing the interesting locations found in a given geospatial region. This is accomplished by modeling the location histories of multiple individuals who traveled through the region of interest, and identifying interesting locations in the region based on the number of individuals visiting a location weighted in terms of the travel experience of those individuals. A prescribed number of the top most interesting locations in a specified region can be provided upon request. In addition, prescribed numbers of the top most popular travel sequences through the interesting locations and the top most experienced travelers in the specified region can be provided as well.
    Type: Application
    Filed: February 19, 2009
    Publication date: August 19, 2010
    Applicant: Microsoft Corporation
    Inventors: Yu Zheng, Lizhu Zhang, Xing Xie, Wei-Ying Ma
  • Publication number: 20100199222
    Abstract: In one aspect, a method for interacting with a representation of a family tree is provided. The method comprises receiving family tree information from a user with respect to the family tree, displaying a representation of the family tree based, at least in part, on the received family tree information, receiving update information from the user indicating at least one modification to the family tree and/or the family tree representation, the update information received via the user interacting directly with the graphical representation of the family tree, performing the at least one modification to the family tree and/or family tree representation, and displaying a representation of the family tree with the at least one modification.
    Type: Application
    Filed: January 30, 2009
    Publication date: August 5, 2010
    Inventors: Michael E. P. Kranik, Jill K. Bensen, Jacek A. Lech, Andrzej Szkola, Laura Rodrigues de Miranda,Laura, Leszek P. Rumak
  • Publication number: 20100191716
    Abstract: Methods, systems, and computer program products are provided for performing structured parallel data intensive computations. A SQL-FCF framework that defines a SQL construct based interface for performing the computations is provided. The computations within an application are coded as table valued functions (TVFs). Data for the application is partitioned into data partitions to co-locate and load balance the data partitions and corresponding computations. The TVFs are invoked and applied to corresponding ones of the data partitions in a structured order defined by function control forms (FCF).
    Type: Application
    Filed: January 25, 2009
    Publication date: July 29, 2010
    Inventors: Qiming Chen, Meichun Hsu
  • Publication number: 20100169757
    Abstract: A filtering method for evaluating patents comprises loading each unit of text or figure in a portfolio of patents into digital memory then comparing each unit of text or figure with all other units of text or figures in digital memory using digital data processing. The duplicate units of text or figures are determined and the earliest instance of each duplicate unit of text or figure is identified. The duplicate unit of text or figure, other than earliest instance, are marked as duplicate to create a filtered version of each patent in portfolio. The filtered version of each patent in portfolio is evaluated to determine the uniqueness of the patent specification and the interrelationships between the patents in the portfolio are determined. The interrelationships are illustrated in an electronic workspace for analyzing the portfolio of patents.
    Type: Application
    Filed: December 26, 2008
    Publication date: July 1, 2010
    Inventor: Adam Jude Ahne
  • Publication number: 20100153150
    Abstract: This disclosure provides various embodiments of systems, software, and computerized methods for generating a business adaptation catalog model. In one aspect, the software identifies one of a plurality of solutions associated with a particular application, and identifies a business adaptation catalog associated with the identified solution. The software then retrieves information from the business adaptation catalog defining a set of business elements, and generates a business adaptation catalog model illustrating the one or more business elements. Further, the business adaptation catalog can comprise a data structure defining the hierarchical relationships between the set of business elements and a set of constraints defining at least one relationship between at least two of the set of business elements.
    Type: Application
    Filed: December 12, 2008
    Publication date: June 17, 2010
    Inventors: Uta Prigge, Frank Wagner, Florian Stallmann, Stefan Kaetker
  • Publication number: 20100153219
    Abstract: Computer program products, devices, and methods for generating in-text embedded advertising are described. Embedded advertising is “hidden” or embedded into a message by matching an advertisement to the message and identifying a place in the message to insert the advertisement. For textual messages, statistical analysis of individual sentences is performed to determine where it would be most natural to insert an advertisement. Statistical rules of grammar derived from a language model may be used choose a natural and grammatical place in the sentence for inserting the advertisement. Insertion of the advertisement creates a modified sentence without degrading a meaning of the original sentence, yet also includes the advertisement as a part of a new sentence.
    Type: Application
    Filed: December 12, 2008
    Publication date: June 17, 2010
    Applicant: Microsoft Corporation
    Inventors: Tao Mei, Xian-Sheng Hua, Shipeng Li, Linjun Yang
  • Patent number: 7739220
    Abstract: A book search system and media for generating a book index corresponding to a collection of books and for providing context snippets related to a search string formulated by a user based on the book index are provided. The book index includes a word hash that represents unique words and an offset to a location list that stores locations for each instance of the unique word. The book search system receives the search string from the user, parses the search string to locate phrases and words, and traverses the book index to generate a list of locations for each word or phrase included in the search string. The book search system utilizes a variable-sized container having a maximum size to store subsets of each word or phrase included in the list of locations to generate the context snippets for the search string.
    Type: Grant
    Filed: February 27, 2007
    Date of Patent: June 15, 2010
    Assignee: Microsoft Corporation
    Inventor: Innokentiy Gennadyevich Basmov
  • Publication number: 20100114918
    Abstract: The invention relates to identification of individual nucleic acid sequences from a mixed nucleic acid population. A typical application is to determine the bacteria present in sample containing a mix of several different bacteria. Present techniques require initial cultivation of the mixed bacteria sample and manual separation of the bacteria prior to sequencing. The invention allows for identification of the different bacteria by direct sequencing of the mixed bacteria sample without prior cultivation and separation. One aspect of the invention relates to generating a degenerate sequence from a chromatogram obtained by sequencing a mixed bacteria sample. Another aspect relates to base-calling, i.e. identification of individual sequences making up the degenerate sequence from the mixed bacteria sample. In this aspect, the degenerate sequence is divided into degenerate subsequences from which query subsequence combinations are generated.
    Type: Application
    Filed: September 5, 2007
    Publication date: May 6, 2010
    Applicant: ISENTIO AS
    Inventors: Bjarte Karlsen, Øyvind Kommedal, Øystein Sæebø
  • Publication number: 20100106687
    Abstract: The invention relates to the use of history information as an aid to synchronization in a peer-to-peer system. In particular, node trees are used to represent portions of files systems designated for synchronization. The nodes in the node tree embody history information regarding associated objects. The history information includes version vectors that are used to simplify synchronization-related comparisons and create job lists that may be used to bring participating peers into synchronization.
    Type: Application
    Filed: December 17, 2009
    Publication date: April 29, 2010
    Applicant: APPLE INC.
    Inventors: M. Scott Marcy, Brent Eric Knight
  • Publication number: 20100106739
    Abstract: This invention is a generically constructed and authenticated relational database, the main aim of which is to manage data, records and logistics information and the tracing of said data and typically applied to a variety of workflow processes in e.g., but not restricted to, science and industry. To this end information is entered through notebooks or through instruments into a database that can be either a single user system or a full system. A single user system has limited functionality and can be connected to only a single full system at a time, whereas a full system is able to communicate with a plurality of single user systems, databases and other full systems according to the present innovation. This system authenticates data and can be used for reverse tracing to for instance lab animals in biomedical research, and forward tracing to for instance the retail part of the food value chain from the animal of origin or from ingredients like feed or other components added to the chain.
    Type: Application
    Filed: March 12, 2008
    Publication date: April 29, 2010
    Applicant: Science Linker AS
    Inventor: Knut Petter Daehlin Lehre
  • Publication number: 20100094860
    Abstract: In one embodiment, a method for a detection server in communication with each of multiple web pages of multiple websites on multiple web servers, the detection server in communication with an ad indexing server, includes automatically accessing from the detection server a file for rendering the web page from a web server, automatically building an object model of the web page at the detection server using the accessed file, automatically scanning the object model at the detection server for one or more elements that are advertisements, automatically analyzing each scanned advertisement at the detection server to determine one or more attributes of the scanned advertisement, and automatically storing data at the ad indexing server on the determined attributes of the scanned advertisements found at the detection server to facilitate an indexing of advertisements on the web pages of the websites.
    Type: Application
    Filed: October 9, 2008
    Publication date: April 15, 2010
    Applicant: Google Inc.
    Inventors: Wayne W. Lin, Matthew S. Weaver, Eran Timor, Tal Cohen, Nicholas S. Arini, Theodore Vassilakis
  • Publication number: 20100077010
    Abstract: A method for identifying entry points of a hierarchical structure having a plurality of nodes includes the operations selecting a node of a hierarchical structure and testing it for identification as an entry point. The node is identified as an entry point, and the selection, testing, and identification operations are repeated for at least one additional node of the hierarchical structure to identify at least a second node as a respective second entry point for the hierarchical structure.
    Type: Application
    Filed: September 5, 2008
    Publication date: March 25, 2010
    Applicant: Nvidia Corporation
    Inventors: Timo AILA, Samuli Laine
  • Publication number: 20100057764
    Abstract: A method and apparatus for creating custom dimension trees. The method may include receiving a user request to create a custom dimension tree, displaying a list of available dimensions, and receiving user selection of available dimensions from the list. The method may further include allowing the user to create virtual dimensions, mapping elements of the available dimensions to the virtual dimensions, and creating the custom dimension tree using the mapping. The custom dimension tree represents relationships between the virtual dimensions.
    Type: Application
    Filed: August 29, 2008
    Publication date: March 4, 2010
    Inventor: Eric J. Williamson
  • Publication number: 20100043012
    Abstract: An electronic system comprises a memory, a parser, and a device driver. A plurality of applications and a document are stored in a user space of the memory, the document storing configuration parameters. The parser module parses the document to retrieve the parameters in response to invocation from at least one application. The device driver creates data structure for the parameters in the kernel space of the memory, thus to facilitate a plurality of programs to execute different functions of the system by commonly utilizing the parameters through the device driver.
    Type: Application
    Filed: July 22, 2009
    Publication date: February 18, 2010
    Applicants: AMBIT MICROSYSTEMS (SHANGHAI) LTD., HON HAI PRECISION INDUSTRY CO., LTD.
    Inventor: YAO-HONG DU
  • Publication number: 20100036865
    Abstract: A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph.
    Type: Application
    Filed: August 7, 2008
    Publication date: February 11, 2010
    Applicant: Yahoo! Inc.
    Inventors: Jayavel SHANMUGASUNDARAM, Minos Garofalakis, Erik Vee, Ashwin Kumar Machanavajjhala
  • Publication number: 20100023535
    Abstract: An intermediary apparatus, an intermediary method, and a computer program product thereof for storing data in a storage apparatus, and a data storage system comprising the same are provided. The storage apparatus has a storage zone with a signature field, and the signature field stores a first signature value. The data has index information and a data signature value. After searching out the storage zone according to the index information, the intermediary apparatus extracts the first signature value from the storage zone, and then determines if the data has been stored in the storage zone according to the first signature value and the data signature value. If not, the intermediary apparatus writes the data into the storage zone; otherwise, ignores the data.
    Type: Application
    Filed: August 25, 2008
    Publication date: January 28, 2010
    Applicant: INSTITUTE FOR INFORMATION INDUSTRY
    Inventors: Da-Gang Lee, Hung-Jyun Mu, Chun-Sho Lee, Tei-Wei Kuo, Pei-Lun Suei, Rong-Jhang Liao, Yung-Feng Lu
  • Publication number: 20090307186
    Abstract: A database management apparatus including an auxiliary storage unit for storing structured data and a database management part for managing the structured data, which extracts all paths showing a storage position of the structured data to be processed from an SQL statement for processing the structured data; when a plurality of the paths are extracted, the database management apparatus compares the extracted paths with each other, and extracts as a common path a common part of both the paths; and processes using the SQL statement the structured data of nodes of the storage position or lower shown by the extracted common path.
    Type: Application
    Filed: February 10, 2009
    Publication date: December 10, 2009
    Applicant: Hitachi, Ltd.
    Inventors: Akiko HOSHINO, Norihiro HARA, Shota KUMAGAI
  • Publication number: 20090292679
    Abstract: Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.
    Type: Application
    Filed: May 20, 2009
    Publication date: November 26, 2009
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Amit Ganesh, Juan R. Loaiza, Krishna Kunchithapadam