Sciweavers

3514 search results - page 388 / 703
» On Moving Object Queries
Sort
View
ALGORITHMICA
2011
15 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
EGC
2005
Springer
16 years 7 days ago
Implementation of Federated Databases Through Updatable Views
We present a new approach to the grid technology that is based on federated databases and updatable views. Views are used in two ways: (1) as wrappers of local servers that adopt l...
Hanna Kozankiewicz, Krzysztof Stencel, Kazimierz S...
CIDR
2007
155views Algorithms» more  CIDR 2007»
15 years 8 months ago
Object-level Vertical Search
Current web search engines essentially conduct document-level ranking and retrieval. However, structured information about realworld objects embedded in static webpages and online...
Zaiqing Nie, Ji-Rong Wen, Wei-Ying Ma
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 11 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
15 years 10 months ago
Making the Most of Cache Groups
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
Andreas Bühmann, Theo Härder