Sciweavers

439 search results - page 76 / 88
» Unnesting Arbitrary Queries
Sort
View
CIKM
2003
Springer
14 years 3 months ago
Operational requirements for scalable search systems
Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system arch...
Abdur Chowdhury, Greg Pass
ISMIS
2003
Springer
14 years 3 months ago
NETMARK: A Schema-Less Extension for Relational Databases for Managing Semi-structured Data Dynamically
Object-Relational database management system is an integrated hybrid cooperative approach to combine the best practices of both the relational model utilizing SQL queries and the ...
David A. Maluf, Peter B. Tran
EDBT
2009
ACM
108views Database» more  EDBT 2009»
14 years 2 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...
SSD
2001
Springer
103views Database» more  SSD 2001»
14 years 2 months ago
Similarity of Cardinal Directions
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...
Roop K. Goyal, Max J. Egenhofer
STACS
2001
Springer
14 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid