4850 search results - page 108 / 970 » Approximate Data Structures with Applications |
176
Voted
VLDB
2001
ACM
16 years 28 days ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
93
Voted
GEOINFO
2003
15 years 2 months ago
2003
Abstract. One of the most important features in an urban geographic information system is the ability to locate addresses, in any form employed by the population, in a quick and ef...
93
Voted
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
92
Voted
ER
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present an approach to support incremental navigation of structured information, where the structure is introduced by the data model and schema (if present) of a data ...
112
Voted
AINA
2009
IEEE
14 years 10 months ago
2009
IEEE
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...