2019 · 95 citations · 14 references
ComputingComputer ScienceData ManagementData StructuresDatabasesQuery ProcessingSpatial Data ModelsSpatial Data StructuresSpatial Database SystemsSpatial DatabasesSpatial PartitioningData AccessDatabase Management SystemsIndex StructuresLocation-based ServicesR-tree IndexingR-treesSpatial IndexingSpatial Query Processing
With the pervasiveness of location-based services (LBS), spatial data processing has received considerable attention in the research of database system management. Among various spatial query techniques, index structures play a key role in data access and query processing. However, existing spatial index structures (e.g., R-tree) mainly focus on partitioning data space or data objects. In this paper, we explore the potential to construct the spatial index structure by learning the distribution of the data. We design a new data-driven spatial index structure, namely learned Z-order Model (ZM) index, which combines the Z-order space filling curve and the staged learning model. Experimental results on both real and synthetic datasets show that our learned index significantly reduces the memory cost and performs more efficiently than R-tree in most scenarios.
14
Multilayer feedforward networks are universal approximators
Kurt Hornik, Maxwell B. Stinchcombe, Halbert White · Neural Networks · 1989 · 21.2K citations
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., WhiteH. · Neural Networks · 1989 · 9.4K citations
J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik · ACM Transactions on Database Systems · 1984 · 1.1K citations · Full text
A class of data structures for associative searching
Jack Orenstein, T. H. Merrett · 1984 · 398 citations · Full text