Sciweavers

51 search results - page 7 / 11
» Dynamically Optimizing High-Dimensional Index Structures
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 2 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
STDBM
2004
Springer
143views Database» more  STDBM 2004»
14 years 24 days ago
Indexing Query Regions for Streaming Geospatial Data
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
Quinn Hart, Michael Gertz
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...