公开(公告)号：US20130272509A1

公开(公告)日：2013-10-17

申请号：US13871263

申请日：2013-04-26

Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.

Inventor： Steven N. TISCHER ,  Robert J. STARR

IPC: H04M3/493

CPC classification number: H04M3/493 ,  G06F17/30961

Abstract: An interface prompts a user to enter a marker during a communications session, in which the user is able to later provide a subsequent version of the marker. Initially, a first version of the marker is received from the user. A processor associates the first version of the marker received from the user with a particular position in an information tree and stores the particular position in the information tree associated with the first version of the marker. A second version of the marker is received from the user and in response, the user is returned to the particular position in the information tree that has been stored and associated with the first version of the marker received from the user.

Abstract translation: 接口提示用户在通信会话期间输入标记，其中用户稍后可以提供标记的后续版本。 最初，从用户接收标记的第一版本。 处理器将从用户接收的标记的第一版本与信息树中的特定位置相关联，并将特定位置存储在与标记的第一版本相关联的信息树中。 从用户接收标记的第二版本，作为响应，将用户返回到已经存储并与从用户接收的标记的第一版本相关联的信息树中的特定位置。

公开(公告)号：US08549398B2

公开(公告)日：2013-10-01

申请号：US12881155

申请日：2010-09-13

Applicant: Henrik Loeser

Inventor： Henrik Loeser

IPC: G06F17/00 ,  G06F12/00

CPC classification number: G06F17/30923 ,  G06F17/30011 ,  G06F17/30613 ,  G06F17/30911 ,  G06F17/30961

Abstract: The invention relates to detecting non-presence of nodes in a document of semi-structured data and to creating a values index which properly reflects this non-presence. The document of semi-structured data, comprising multiple hierarchically organized nodes, is scanned for values (step 110). Subsequently, these values are indexed (step 120). As non-presence of at least one node is detected (step 140), this non-presence is documented by enhancing the values index (12) by a pseudo key (20) (step 150).

Abstract translation: 本发明涉及检测半结构化数据的文档中不存在节点并且创建适当地反映该不存在的值索引。 扫描包含多个分层组织的节点的半结构化数据的文档（步骤110）。 随后，对这些值进行索引（步骤120）。 由于检测到不存在至少一个节点（步骤140），所以通过用伪密钥（20）增强值索引（12）来记录该不存在（步骤150）。

公开(公告)号：US08543648B1

公开(公告)日：2013-09-24

申请号：US12966926

申请日：2010-12-13

Applicant: Christopher G. Rhodes ,  Paul K. Young

Inventor： Christopher G. Rhodes ,  Paul K. Young

IPC: G06F15/16 ,  G06F15/173 ,  G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30961 ,  G06F17/30958 ,  G06Q50/01

Abstract: Various embodiments enable finding collaborations in a network. One embodiment obtains collaboration data for a plurality of nodes, receives a request to locate at least one collaboration for a user, generates a search tree starting by determining a source node of the collaboration data, the search tree including at least two levels, and expanding the search tree until at least one target node is located that corresponds to a solution for the request, optimizes the search tree to attempt to reduce the number of solutions, generates an adjacency list of adjacent nodes in the optimized search tree, searches the adjacency list to locate at least one shortest path to the target node, and generates a list of collaboration data that is associated with the at least one shortest path from the source node to the target node.

Abstract translation: 各种实施例使得能够在网络中找到协作。 一个实施例获得多个节点的协作数据，接收为用户定位至少一个协作的请求，通过确定协作数据的源节点，搜索树至少包括两个级别，并扩展 搜索树，直到至少一个目标节点位于与该请求的解决方案相对应的位置，优化搜索树以尝试减少解的数量，生成优化的搜索树中相邻节点的邻接列表，搜索邻接列表 以定位到目标节点的至少一个最短路径，并且生成与从源节点到目标节点的至少一个最短路径相关联的协作数据的列表。

公开(公告)号：US20130212057A1

公开(公告)日：2013-08-15

申请号：US13510990

申请日：2010-11-04

Applicant: Seung Woo Lee ,  Pyung Kim ,  Han Min Jung ,  Mi Kyoung Lee ,  Dong Min Seo ,  Won Kyung Sung

Inventor： Seung Woo Lee ,  Pyung Kim ,  Han Min Jung ,  Mi Kyoung Lee ,  Dong Min Seo ,  Won Kyung Sung

IPC: G06N5/02 ,  G06F17/30

CPC classification number: G06N5/025 ,  G06F17/30312 ,  G06F17/30613 ,  G06F17/30731 ,  G06F17/30734 ,  G06F17/30867 ,  G06F17/30961 ,  G06N5/02 ,  G06N5/04 ,  G06N5/046

Abstract: A method and apparatus for storing a triple and an inference dependency indexing apparatus appropriate to the method and system are provided. The method of storing a triple related to an inference method for creating other triples by applying an inference rule to the triple includes: (a) adding a serial number to each of triples and inference rules related to inference and storing the triples and the inference rules into a plurality of triple tables and inference rule tables; (b) indexing a triple inferred by applying the triple and the inference rule, using a serial number of the triple and a serial number of the inference rule related to inference; and (c) creating a triple view which allows accessing the triples physically distributed and stored in a plurality of triple storage units (tables) as if the triples are stored in a virtual storage unit (table).

Abstract translation: 提供了一种用于存储适用于该方法和系统的三元和推理依赖索引设备的方法和装置。 通过将推理规则应用于三元组，存储与推理方法相关的三元组的方法包括：（a）将序列号添加到与推理相关的三元组和推理规则中，并存储三元组和推理规则 成多个三重表和推理规则表; （b）通过应用三元组和推理规则来索引三重推理，使用与推理相关的推理规则的三元组和序列号的序列号; （c）创建三重视图，其允许访问物理分布并存储在多个三重存储单元（表格）中的三元组，就好像三元组被存储在虚拟存储单元（表格）中一样。

公开(公告)号：US08504579B1

公开(公告)日：2013-08-06

申请号：US12982532

申请日：2010-12-30

Applicant: Jerome Broekhuijsen

Inventor： Jerome Broekhuijsen

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30961

Abstract: A computing device configured for filtering a data set is described. The computing device includes a processor and executable instructions stored in memory that is in electronic communication with the processor. The computing device obtains a data set. The computing device also selects nodes from multiple trees to produce a node selection. The computing device further generates a composite filter based on the node selection. The computing device additionally filters the data set based on the composite filter to produce a working data set.

Abstract translation: 描述了配置用于过滤数据集的计算设备。 计算设备包括处理器和存储在与处理器电子通信的存储器中的可执行指令。 计算设备获取数据集。 计算设备还从多个树中选择节点以产生节点选择。 计算装置还基于节点选择生成复合滤波器。 计算设备还基于复合滤波器过滤数据集以产生工作数据集。

公开(公告)号：US20130198239A1

公开(公告)日：2013-08-01

申请号：US13625812

申请日：2012-09-24

Applicant: Jack J. LeToruneau

Inventor： Jack J. LeToruneau

IPC: G06F17/30

CPC classification number: G06F17/30336 ,  G06F17/30327 ,  G06F17/30961

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

公开(公告)号：US20130185271A1

公开(公告)日：2013-07-18

申请号：US13352256

申请日：2012-01-17

Applicant: Owen Joseph Strain ,  Wenguang Wang

Inventor： Owen Joseph Strain ,  Wenguang Wang

IPC: G06F17/30

CPC classification number: G06F17/30362 ,  G06F17/30327 ,  G06F17/30961

Abstract: The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node.

Abstract translation: 本技术包括优化的b-tree。 为了改善并发访问，可以在锁耦合中对b-tree的遍历节点应用读锁。 当确定节点可能被修改时，读锁定节点可被升级到写锁定节点，其中锁定节点首先限制对其他功能的访问，然后当访问该节点的所有现有功能时向该节点应用写锁定 结束。 如果其他功能之一尝试提升后续功能，可以从树中取消并删除。 如果在考虑诸如功能类型，无论是叶节点，节点中的密钥数量还是子节点中的密钥数量等多个因素时可能会修改节点，则可以提升节点。

公开(公告)号：US20130132450A1

公开(公告)日：2013-05-23

申请号：US13628774

申请日：2012-09-27

Applicant: FUJITSU LIMITED

Inventor： Yuichi TSUCHIMOTO ,  Toshihiro Shimizu

IPC: G06F17/17

CPC classification number: G06F17/10 ,  G06F17/30946 ,  G06F17/30961

Abstract: A computer-readable recording medium storing a program causing a processor to execute an operation, the operation includes associating a mathematical function of which a domain includes a key to uniquely specify data to be stored, with each node; associating an index value indicating an amount of the data, with each node; substituting the key in the mathematical function to calculate a value of the mathematical function; substituting the value of the mathematical function and the index value in a weighting function, of which a domain includes the value of the mathematical function and the index value, and in which a size relationship of values of the weighting function is defined in a range of the weighting function, to calculate a value of the weighting function for every node; determining a node in which the data is to be stored, based on the size relationship; and outputting the node.

Abstract translation: 一种存储导致处理器执行操作的程序的计算机可读记录介质，所述操作包括将包括密钥的域的数学函数与每个节点唯一地指定要存储的数据相关联; 将指示数据量的索引值与每个节点相关联; 用数学函数中的键代替数学函数的值; 在加权函数中代替数学函数的值和索引值，其中域包括数学函数和索引值的值，并且其中加权函数的值的大小关系被定义在 加权函数，以计算每个节点的加权函数的值; 基于大小关系确定要存储数据的节点; 并输出节点。

公开(公告)号：US20130091174A1

公开(公告)日：2013-04-11

申请号：US13670052

申请日：2012-11-06

Applicant: Apple Inc.

Inventor： Olivier Bonnet ,  Frederic de Jaeger ,  Romain Goyet

IPC: G06F17/30

CPC classification number: G06F17/30961 ,  G06F17/27 ,  G06F17/2705 ,  G06F17/271

Abstract: An apparatus for processing a sequence of tokens to detect predetermined data, wherein each said token has a token type, and the predetermined data has a structure that comprises a predetermined sequence of token types, including at least one optional token type. The apparatus comprises a processor arranged to: provide a tree for detecting the predetermined data, the tree comprising a plurality of states, each said state being linked with at least one other state by a respective condition, the arrangement of linked states forming a plurality of paths; and compare the token types of the sequence of tokens to respective conditions in the tree to match the sequence of tokens to one or more paths in the tree, wherein the predetermined data can be detected without using an epsilon reduction to take account of said at least one optional token type.

公开(公告)号：US20130066898A1

公开(公告)日：2013-03-14

申请号：US13229369

申请日：2011-09-09

Applicant: Enyuan Wu

Inventor： Enyuan Wu

IPC: G06F17/30

CPC classification number: G06F17/30961 ,  G06F17/30864

Abstract: One or more techniques and/or systems are disclosed for matching a target string to a known string. A target string is broken into one or more target terms, and the one or more target terms are matched to known terms in an index tree. The index tree comprises one or more known terms from a plurality of known strings, where the respective known terms in the index tree are associated with one or more known string IDs. A known term that is associated with a known string ID (in the index tree, and to which a target term is matched), is comprised in a known string, which corresponds to the known string ID. The target string can be matched to the known string using the known string's corresponding known string ID that is associated with a desired number of occurrences in the matching of the one or more target terms.

Abstract translation: 公开了一种或多种技术和/或系统，用于将目标字符串与已知字符串进行匹配。 目标字符串被分解为一个或多个目标术语，并且一个或多个目标术语与索引树中的已知术语相匹配。 索引树包括来自多个已知字符串的一个或多个已知项，其中索引树中的各个已知项与一个或多个已知字符串ID相关联。 与已知字符串ID相关联的已知字符串（在索引树中，并且目标词匹配到其中）被包含在对应于已知字符串ID的已知字符串中。 目标字符串可以使用已知字符串的对应的已知字符串ID与已知字符串匹配，该字符串ID与所述一个或多个目标项的匹配中的期望出现次数相关联。