Sciweavers

164 search results - page 22 / 33
» Reverse Top-k Queries
Sort
View
EDBT
2009
ACM
108views Database» more  EDBT 2009»
14 years 1 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
KBSE
1998
IEEE
14 years 21 days ago
An Automated Approach for Supporting Software Reuse via Reverse Engineering
Formal approaches to software reuse rely heavily upon specificationmatchingcriterion, where asearch query using formal specifications is used to search a library of components ind...
Gerald C. Gannod, Yonghao Chen, Betty H. C. Cheng
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 8 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
DAGSTUHL
2001
13 years 9 months ago
An Overview of the GXL Graph Exchange Language
GXL (Graph eXchange Language) is designed to be a standard exchange format for graph-based tools. GXL is defined as an XML sublanguage, which offers support for exchanging instanc...
Andreas Winter, Bernt Kullbach, Volker Riediger