公开(公告)号：US11100068B2

公开(公告)日：2021-08-24

申请号：US16370802

申请日：2019-03-29

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward ,  David S. Alavi

IPC分类号： G06F16/22 ,  G06F16/2458 ,  G06F16/23

摘要： A method includes generating from a time-series dataset multiple corresponding time-slice datasets. Each time-slice dataset has a corresponding time-slice time index and includes field-value data strings and associated field-value-time-index data strings, or pointers indicating the corresponding strings in an earlier time-slice dataset, that are the latest in the time-series dataset that are also earlier than the corresponding time-slice time index. A query of the time-series dataset for latest data records earlier than a given query time index is performed by using the time-slice datasets to reduce or eliminate the need to directly access or interrogate the time-series dataset.

公开(公告)号：US20190294599A1

公开(公告)日：2019-09-26

申请号：US16370802

申请日：2019-03-29

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward ,  David S. Alavi

IPC分类号： G06F16/22 ,  G06F16/2458

摘要： A method includes generating from a time-series dataset multiple corresponding time-slice datasets. Each time-slice dataset has a corresponding time-slice time index and includes field-value data strings and associated field-value-time-index data strings, or pointers indicating the corresponding strings in an earlier time-slice dataset, that are the latest in the time-series dataset that are also earlier than the corresponding time-slice time index. A query of the time-series dataset for latest data records earlier than a given query time index is performed by using the time-slice datasets to reduce or eliminate the need to directly access or interrogate the time-series dataset.

公开(公告)号：US09626401B1

公开(公告)日：2017-04-18

申请号：US14873625

申请日：2015-10-02

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward

IPC分类号： G06F17/30

CPC分类号： G06F17/30327 ,  G06F17/30442 ,  G06F17/30589

摘要： A data structure comprises a clump header table, an inline tree data structure, and one or more auxiliary data structures. Each clump header record includes an indicator of a location in the inline tree data structure of corresponding binary string segments. Clump header records or auxiliary header records include indicators of corresponding locations in the corresponding auxiliary data structure. Each auxiliary data structure can be altered without necessarily altering the inline tree or clump header table. A dedicated, specifically adapted conversion program generates the clump header file, the inline tree data structure, and the one or more auxiliary data structures. The data structure can be stored on any computer-readable medium, and can be read entirely into RAM to be searched (with or without filtering on one or more filter data fields). A dedicated, specifically adapted search and filter program is employed, which can list or enumerate the retrieved data records.

公开(公告)号：US10521411B2

公开(公告)日：2019-12-31

申请号：US15233047

申请日：2016-08-10

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward

IPC分类号： G06F16/00 ,  G06F16/22 ,  G06F16/2455

摘要： An inline tree data structure and one or more auxiliary data structure encode a multitude of data records of a dataset; data fields of the dataset define a tree hierarchy. The inline tree comprises one binary string for each data record that are all the same length, are arranged in an ordered sequence that corresponds to the tree hierarchy, and include an indicator string indicating position in the tree hierarchy of each data record relative to an immediately adjacent data record. A search program is guided through the dataset by interrogating each indicator string in the inline tree data structure so as to reduce unnecessary interrogation of data field values.

公开(公告)号：US20180046655A1

公开(公告)日：2018-02-15

申请号：US15233047

申请日：2016-08-10

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward

IPC分类号： G06F17/30

摘要： An inline tree data structure and one or more auxiliary data structure encode a multitude of data records of a dataset; data fields of the dataset define a tree hierarchy. The inline tree comprises one binary string for each data record that are all the same length, are arranged in an ordered sequence that corresponds to the tree hierarchy, and include an indicator string indicating position in the tree hierarchy of each data record relative to an immediately adjacent data record. A search program is guided through the dataset by interrogating each indicator string in the inline tree data structure so as to reduce unnecessary interrogation of data field values.

公开(公告)号：US09411898B1

公开(公告)日：2016-08-09

申请号：US14489430

申请日：2014-09-17

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/3087 ,  G06F17/30312 ,  G06F17/30321

摘要： Generating and storing, for a multitude of polygonal areas, spatial coordinates of a multitude of piecewise-linear spatial boundary segments. The polygonal boundary of each area comprises boundary segments; each boundary segment forms a portion of the polygonal boundary of at most two adjacent spatial areas. Can further include one or both of (i) an indicator, for each spatial boundary segment, of the at most two corresponding adjacent spatial areas that are separated by that boundary segment or (ii) an indicator, for each spatial area, of one or more boundary segments that together form the entire polygonal boundary of that spatial area. The electronic indicia of the second dataset can be used, inter alia, (i) to determine in which of a multitude of at least partly contiguous spatial areas is located a given spatial point, or (ii) to graphically render the polygonal borders of the areas.

公开(公告)号：US20200233843A1

公开(公告)日：2020-07-23

申请号：US16719853

申请日：2019-12-18

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward

IPC分类号： G06F16/22 ,  G06F16/2455

摘要： An inline tree data structure and one or more auxiliary data structure encode a multitude of data records of a dataset; data fields of the dataset define a tree hierarchy. The inline tree comprises one binary string for each data record that are all the same length, are arranged in an ordered sequence that corresponds to the tree hierarchy, and include an indicator string indicating position in the tree hierarchy of each data record relative to an immediately adjacent data record. A search program is guided through the dataset by interrogating each indicator string in the inline tree data structure so as to reduce unnecessary interrogation of data field values.

公开(公告)号：US10248621B2

公开(公告)日：2019-04-02

申请号：US15019965

申请日：2016-02-09

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward ,  David S. Alavi

IPC分类号： G06F16/00 ,  G06F16/22 ,  G06F16/2458 ,  G06F16/27 ,  G06F16/23

摘要： A method includes generating from a time-series dataset multiple corresponding time-slice datasets. Each time-slice dataset has a corresponding time-slice time index and includes field-value data strings and associated field-value-time-index data strings, or pointers indicating the corresponding strings in an earlier time-slice dataset, that are the latest in the time-series dataset that are also earlier than the corresponding time-slice time index. A query of the time-series dataset for latest data records earlier than a given query time index is performed by using the time-slice datasets to reduce or eliminate the need to directly access or interrogate the time-series dataset.

公开(公告)号：US20170228405A1

公开(公告)日：2017-08-10

申请号：US15019965

申请日：2016-02-09

申请人： Moonshadow Mobile, Inc.

发明人： Roy W. Ward ,  David S. Alavi

IPC分类号： G06F17/30

CPC分类号： G06F17/30321 ,  G06F17/30377 ,  G06F17/30548

摘要： A method includes generating from a time-series dataset multiple corresponding time-slice datasets. Each time-slice dataset has a corresponding time-slice time index and includes field-value data strings and associated field-value-time-index data strings, or pointers indicating the corresponding strings in an earlier time-slice dataset, that are the latest in the time-series dataset that are also earlier than the corresponding time-slice time index. A query of the time-series dataset for latest data records earlier than a given query time index is performed by using the time-slice datasets to reduce or eliminate the need to directly access or interrogate the time-series dataset.

公开(公告)号：US09697250B1

公开(公告)日：2017-07-04

申请号：US14678982

申请日：2015-04-04

申请人： MOONSHADOW MOBILE, INC.

发明人： Roy W. Ward

IPC分类号： G06F17/30

CPC分类号： G06F17/30424 ,  G06F17/2252 ,  G06F17/2258 ,  G06F17/246 ,  G06F17/30327 ,  G06F17/30589 ,  G06F17/30961

摘要： A binary data file embodies an inline tree data structure storing fields of a hierarchical dataset. The inline tree comprises first-level binary string segments, each comprising substantially contiguous second-level binary string segments, corresponding to subranges of first and second subsets of data fields. Size is reduced by substituting: binary string indices for alphanumeric strings; a data clump index for a set of correlated/anticorrelated strings; field masks for unoccupied data fields. A dedicated conversion program generates the inline tree from conventional database formats, which is read entirely into RAM to be searched/filtered by a dedicated search/filter program. Small size ( 106 records (>100 data fields) in