Sciweavers

320 search results - page 56 / 64
» A New Compression Method with Fast Searching on Large Databa...
Sort
View
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 2 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICASSP
2008
IEEE
14 years 2 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 24 days ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu