Geographically partitioned online search system
First Claim
Patent Images
1. A system, comprising:
- a processor in communication with a memory; and
the memory including a set of instructions executable by the processor to geographically partition a data structure, wherein the geographically partitioned data structure is organized to include information resident in a number of databases geographically-partitioned (geo-partitioned) according to a number of shards, the geographically partitioned data structure including;
a geographically-hashed (geo-hash) look up table containing a number of geo-hash ranges associated with respective database server information, wherein the geo-partitioned databases are partitioned into geographic areas for shards such that search queries limited to a particular geographic location can touch between one to four shards, the geo-hash look up table to receive a function call including a geographic location identifier and a client network node identifier parameter to the function call and link the client network node to a particular server node and an associated geo-partitioned database containing the geo-hash ranges in a shard data object table to perform a query; and
a plurality of user data object tables, each user data object table containing respective user data attributes including a data value representing an amount of user recommendation credit associated with a particular user available for submitting a recommendation, wherein the amount of recommendation credit is decremented after submitting a recommendation, and wherein the respective user data attributes further include user recommendation credit data attributes that include geo-tagged recommendations of online documents or geo-tagged recommendations of mobile print locations received from client network nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
In one example, a memory includes a data structure organized to include information resident in a number of databases geographically-partitioned according to a number of shards. The data structure includes a geographically-hashed look up table containing a number of geo-hash ranges associated with the shards and is organized to enable instructions to execute and access the ranges according to a number of characters in a generated geo-hash value. The data structure also includes a plurality of user data object tables that contain respective user data attributes and link to a particular server node and an associated geo-partitioned database.
29 Citations
9 Claims
-
1. A system, comprising:
-
a processor in communication with a memory; and the memory including a set of instructions executable by the processor to geographically partition a data structure, wherein the geographically partitioned data structure is organized to include information resident in a number of databases geographically-partitioned (geo-partitioned) according to a number of shards, the geographically partitioned data structure including; a geographically-hashed (geo-hash) look up table containing a number of geo-hash ranges associated with respective database server information, wherein the geo-partitioned databases are partitioned into geographic areas for shards such that search queries limited to a particular geographic location can touch between one to four shards, the geo-hash look up table to receive a function call including a geographic location identifier and a client network node identifier parameter to the function call and link the client network node to a particular server node and an associated geo-partitioned database containing the geo-hash ranges in a shard data object table to perform a query; and a plurality of user data object tables, each user data object table containing respective user data attributes including a data value representing an amount of user recommendation credit associated with a particular user available for submitting a recommendation, wherein the amount of recommendation credit is decremented after submitting a recommendation, and wherein the respective user data attributes further include user recommendation credit data attributes that include geo-tagged recommendations of online documents or geo-tagged recommendations of mobile print locations received from client network nodes. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system, comprising:
-
a processor in communication with a memory; and the memory including a set of instructions executable by the processor to geographically partition a data structure, wherein the geographically partitioned data structure is organized to include information resident in a number of databases geographically-partitioned (geo-partitioned) according to a number of shards, the geographically partitioned data structure including; a geographically-hashed (geo-hash) look up table containing a number of geo-hash ranges associated with respective database server information, wherein the geo-partitioned databases are partitioned into geographic areas for shards such that search queries limited to a particular geographic location can touch between one to four shards, the geo-hash look up table linking the client network node to a database server to perform a query, the database server containing the geo-hash ranges in a shard data object table containing a tag attribute, a geographic location attribute, and a title attribute; and a plurality of user data object tables, each user data object table containing respective user data attributes including a data value representing an amount of user recommendation credit associated with a particular user available for submitting a recommendation, wherein the amount of recommendation credit is decremented after submitting a recommendation, the plurality of user data object tables to link to the database server to perform the query, and wherein the respective user data attributes further include user recommendation credit data attributes that include geo-tagged recommendations of online documents or geo-tagged recommendations of mobile print locations received from client network nodes. - View Dependent Claims (7, 8, 9)
-
Specification