Sciweavers

2099 search results - page 173 / 420
» Similarity for Conceptual Querying
Sort
View
SBBD
2004
106views Database» more  SBBD 2004»
15 years 3 months ago
Twisting the Metric Space to Achieve Better Metric Trees
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
César Feijó Nadvorny, Carlos A. Heus...
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 1 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
SAC
2011
ACM
14 years 4 months ago
Site-autonomous distributed semantic caching
Semantic caching augments cached data with a semantic description of the data. These semantic descriptions can be used to improve execution time for similar queries by retrieving ...
Norvald H. Ryeng, Jon Olav Hauglid, Kjetil N&oslas...
207
Voted
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 1 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
CIKM
2010
Springer
15 years 9 days ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...