-
公开(公告)号：US09753965B2
公开(公告)日：2017-09-05
申请号：US14214296
申请日：2014-03-14
申请人： FACTUAL INC.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： H04W4/02 , G06F17/30 , H04W4/00 , G06Q30/02 , G06N99/00 , G06N5/02 , H04L12/24 , G06Q10/10 , G06Q50/00
CPC分类号： G06F17/30241 , G06F17/30289 , G06F17/30345 , G06F17/30365 , G06F17/30377 , G06F17/3038 , G06F17/30507 , G06F17/30551 , G06F17/30589 , G06F17/30598 , G06F17/30616 , G06F17/30705 , G06F17/30864 , G06N5/022 , G06N99/005 , G06Q10/101 , G06Q30/0261 , G06Q30/0282 , G06Q50/01 , H04L41/14 , H04W4/02 , H04W4/50
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
公开(公告)号：US10268708B2
公开(公告)日：2019-04-23
申请号：US16006748
申请日：2018-06-12
申请人： Factual Inc.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F17/30 , H04W4/02 , H04W4/50 , G06Q50/00 , G06Q30/02 , G06Q10/10 , G06N99/00 , G06N5/02 , H04L12/24 , H04W64/00 , H04W4/029 , H04W8/08 , H04W76/38 , H04W88/02 , H04W8/16 , H04W4/021 , H04W16/24 , H04W8/18 , G06F19/00 , H04W16/30 , H04W88/00 , H04W16/00 , H04W16/32
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
公开(公告)号：US20180011888A1
公开(公告)日：2018-01-11
申请号：US15673349
申请日：2017-08-09
申请人： Factual Inc.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F17/30 , H04L12/24 , G06Q50/00 , H04W4/00 , G06Q10/10 , G06N99/00 , G06N5/02 , H04W4/02 , G06Q30/02
CPC分类号： G06F17/30241 , G06F17/30289 , G06F17/30345 , G06F17/30365 , G06F17/30377 , G06F17/3038 , G06F17/30507 , G06F17/30551 , G06F17/30589 , G06F17/30598 , G06F17/30616 , G06F17/30705 , G06F17/30864 , G06N5/022 , G06N99/005 , G06Q10/101 , G06Q30/0261 , G06Q30/0282 , G06Q50/01 , H04L41/14 , H04W4/02 , H04W4/50
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
公开(公告)号：US20200034341A1
公开(公告)日：2020-01-30
申请号：US16590312
申请日：2019-10-01
申请人： Factual Inc.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F16/21 , G06Q30/02 , H04W4/50 , H04W64/00 , H04W4/029 , H04W8/08 , H04W76/38 , H04W88/02 , H04W8/16 , H04W4/021 , H04W4/02 , H04W16/24 , H04W8/18 , G06N20/00 , G06F16/23 , G06F16/29 , G06F16/35 , G06F16/28 , G06F16/31 , G06F16/951 , G06F16/2458 , G06F16/2455 , G06Q10/10 , G06Q50/00 , G06N5/02 , H04L12/24
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
公开(公告)号：US10459896B2
公开(公告)日：2019-10-29
申请号：US16367161
申请日：2019-03-27
申请人： Factual Inc.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F16/21 , G06Q10/10 , G06N5/02 , H04L12/24 , G06F16/23 , G06F16/951 , G06F16/31 , G06F16/28 , G06F16/35 , G06F16/29 , G06N20/00 , H04W8/18 , H04W16/24 , H04W4/50 , G06F16/2455 , G06F16/2458 , H04W64/00 , H04W4/02 , H04W4/021 , H04W8/16 , H04W88/02 , H04W76/38 , H04W8/08 , H04W4/029 , G06Q50/00 , G06Q30/02 , G06F16/335 , H04W16/30 , H04W88/00 , H04W16/00 , H04W16/32
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
6.发明授权公开(公告)号：US09317541B2
公开(公告)日：2016-04-19
申请号：US14214219
申请日：2014-03-14
申请人： Factual, Inc.
发明人： Boris Shimanovsky , Ahad Rana , Chun Kok
CPC分类号： G06F17/30241 , G06F17/30289 , G06F17/30345 , G06F17/30365 , G06F17/30377 , G06F17/3038 , G06F17/30507 , G06F17/30551 , G06F17/30589 , G06F17/30598 , G06F17/30616 , G06F17/30705 , G06F17/30864 , G06N5/022 , G06N99/005 , G06Q10/101 , G06Q30/0261 , G06Q30/0282 , G06Q50/01 , H04L41/14 , H04W4/02 , H04W4/50
摘要： A traditional data processing system is configured to process input data either in batch or in real-time. On one hand, a batch data processing system is limiting because the batch data processing often cannot take into account any data received during the batch data processing. On the other hand, a real-time data processing system is limiting because the real-time system often cannot scale. The real-time data processing system is often limited to dealing with primitive data types and/or a small amount of data. Therefore, it is desirable to address the limitations of the batch data processing system and the real-time data processing system by combining the benefits of the batch data processing system and the real-time data processing system into a single data processing system.
摘要翻译： 传统的数据处理系统被配置为以批量或实时的方式处理输入数据。 一方面，批量数据处理系统是限制性的，因为批量数据处理通常不能考虑在批处理数据处理期间接收的任何数据。 另一方面，实时数据处理系统是限制性的，因为实时系统通常不能扩展。 实时数据处理系统通常限于处理原始数据类型和/或少量数据。 因此，期望通过将批处理数据处理系统和实时数据处理系统的优点结合到单个数据处理系统中来解决批量数据处理系统和实时数据处理系统的局限性。
-
公开(公告)号：US10891269B2
公开(公告)日：2021-01-12
申请号：US15132228
申请日：2016-04-18
申请人： FACTUAL, INC.
发明人： Boris Shimanovsky , Ahad Rana , Chun Kok
IPC分类号： G06F16/21 , G06N20/00 , G06F16/23 , G06F16/29 , G06F16/35 , G06F16/28 , G06F16/31 , G06F16/951 , G06F16/2458 , G06F16/2455 , G06Q10/10 , G06Q50/00 , G05B13/02 , H04W4/029 , H04W76/38 , H04W4/50 , G06Q30/02 , H04L12/24 , H04W4/02 , H04W4/021 , H04W8/08 , H04W8/16 , H04W8/18 , H04W16/24 , H04W64/00 , H04W88/02 , G06N5/02 , G06F16/335 , H04W16/00 , H04W16/30 , H04W16/32 , H04W88/00
摘要： A traditional data processing system is configured to process input data either in batch or in real-time. On one hand, a batch data processing system is limiting because the batch data processing often cannot take into account any data received during the batch data processing. On the other hand, a real-time data processing system is limiting because the real-time system often cannot scale. The real-time data processing system is often limited to dealing with primitive data types and/or a small amount of data. Therefore, it is desirable to address the limitations of the batch data processing system and the real-time data processing system by combining the benefits of the batch data processing system and the real-time data processing system into a single data processing system.
-
公开(公告)号：US20190220447A1
公开(公告)日：2019-07-18
申请号：US16367161
申请日：2019-03-27
申请人： Factual Inc.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F16/21 , G06Q30/02 , G06Q10/10 , G06N5/02 , H04L12/24 , G06F16/23 , G06F16/951 , G06F16/31 , G06F16/28 , G06F16/35 , G06F16/29 , G06N20/00 , H04W8/18 , H04W16/24 , H04W4/50 , G06F16/2455 , G06F16/2458 , H04W64/00 , H04W4/02 , H04W4/021 , H04W8/16 , H04W88/02 , H04W76/38 , H04W8/08 , H04W4/029 , G06Q50/00
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
公开(公告)号：US20210263897A1
公开(公告)日：2021-08-26
申请号：US17080605
申请日：2020-10-26
申请人： FACTUAL INC.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F16/21 , G06N20/00 , G06F16/23 , G06F16/29 , G06F16/35 , G06F16/28 , G06F16/31 , G06F16/951 , G06F16/2458 , G06F16/2455 , G06Q10/10 , G06Q50/00 , G05B13/02 , H04W4/029 , H04W76/38 , H04W4/50 , G06Q30/02 , H04L12/24 , H04W4/02 , H04W4/021 , H04W8/08 , H04W8/16 , H04W8/18 , H04W16/24 , H04W64/00 , H04W88/02 , G06N5/02
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., Jesse Hate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
公开(公告)号：US10817484B2
公开(公告)日：2020-10-27
申请号：US16590312
申请日：2019-10-01
申请人： Factual Inc.
发明人： Ahad Rana , Boris Shimanovsky
IPC分类号： G06F16/21 , G06N20/00 , G06F16/23 , G06F16/29 , G06F16/35 , G06F16/28 , G06F16/31 , G06F16/951 , G06F16/2458 , G06F16/2455 , G06Q10/10 , G06Q50/00 , G05B13/02 , H04W4/029 , H04W76/38 , H04W4/50 , G06Q30/02 , H04L12/24 , H04W4/02 , H04W4/021 , H04W8/08 , H04W8/16 , H04W8/18 , H04W16/24 , H04W64/00 , H04W88/02 , G06N5/02 , G06F16/335 , H04W16/00 , H04W16/30 , H04W16/32 , H04W88/00
摘要： The disclosed apparatus, systems, and methods relate to a location query mechanism that can efficiently determine whether a target entity is located within a region of interest (ROI). At a high level, the location query mechanism can be configured to represent a ROI using one or more polygons. The location query mechanism can, in turn, divide (e.g., tessellate) the one or more polygons into sub-polygons. Subsequently, the location query mechanism can use the sub-polygons to build an index system that can efficiently determine whether a particular location is within any of the sub-polygons. Therefore, when a computing device queries whether a particular location is within the region of interest, the location query mechanism can use the index system to determine whether the particular location is within any of the sub-polygons.
-
-
-
-
-
-
-
-
-
搜索结果
12 条记录 (耗时 0.016 秒)
