@inproceedings{10.1007/978-3-319-11988-5_7,
    abstract = "© Springer International Publishing Switzerland 2014.Metric indexes aim at reducing the amount of distance evaluations carried out when searching a metric space. Spatial approximation trees (sa-trees for short), in particular, are efficient data structures, which have shown to be competitive in metric spaces of medium to high difficulty, or queries with low selectivity. Sa-trees can be also made dynamic, and can use the available space to improve the query performance adding pivot information. In this paper we extend previous work on dynamic satrees with pivots, and show how the pivot information can be used to a full extent to improve the search performance. The result is a technique that allows one to traverse a dynamic sa-tree without necessarily comparing all traversed nodes against the query object. As a result, the novel algorithm makes a much better use of the available space, yielding a saving of distance computations of about 10\% to 70\%, compared with previous sa-tree schemes that use pivot information.",
    year = "2014",
    title = "A dynamic pivoting algorithm based on spatial approximation indexes",
    volume = "8821",
    pages = "70-81",
    doi = "10.1007/978-3-319-11988-5\_7",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"
}

{"_id":"tkKbZsw8wdFkmT4BQ","bibbaseid":"anonymous-adynamicpivotingalgorithmbasedonspatialapproximationindexes-2014","downloads":0,"creationDate":"2017-03-31T19:29:34.765Z","title":"A dynamic pivoting algorithm based on spatial approximation indexes","author_short":null,"year":2014,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"© Springer International Publishing Switzerland 2014.Metric indexes aim at reducing the amount of distance evaluations carried out when searching a metric space. Spatial approximation trees (sa-trees for short), in particular, are efficient data structures, which have shown to be competitive in metric spaces of medium to high difficulty, or queries with low selectivity. Sa-trees can be also made dynamic, and can use the available space to improve the query performance adding pivot information. In this paper we extend previous work on dynamic satrees with pivots, and show how the pivot information can be used to a full extent to improve the search performance. The result is a technique that allows one to traverse a dynamic sa-tree without necessarily comparing all traversed nodes against the query object. As a result, the novel algorithm makes a much better use of the available space, yielding a saving of distance computations of about 10% to 70%, compared with previous sa-tree schemes that use pivot information.","year":"2014","title":"A dynamic pivoting algorithm based on spatial approximation indexes","volume":"8821","pages":"70-81","doi":"10.1007/978-3-319-11988-5_7","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inproceedings{10.1007/978-3-319-11988-5_7,\n abstract = \"© Springer International Publishing Switzerland 2014.Metric indexes aim at reducing the amount of distance evaluations carried out when searching a metric space. Spatial approximation trees (sa-trees for short), in particular, are efficient data structures, which have shown to be competitive in metric spaces of medium to high difficulty, or queries with low selectivity. Sa-trees can be also made dynamic, and can use the available space to improve the query performance adding pivot information. In this paper we extend previous work on dynamic satrees with pivots, and show how the pivot information can be used to a full extent to improve the search performance. The result is a technique that allows one to traverse a dynamic sa-tree without necessarily comparing all traversed nodes against the query object. As a result, the novel algorithm makes a much better use of the available space, yielding a saving of distance computations of about 10\\% to 70\\%, compared with previous sa-tree schemes that use pivot information.\",\n year = \"2014\",\n title = \"A dynamic pivoting algorithm based on spatial approximation indexes\",\n volume = \"8821\",\n pages = \"70-81\",\n doi = \"10.1007/978-3-319-11988-5\\_7\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\"\n}\n\n","key":"10.1007/978-3-319-11988-5_7","id":"10.1007/978-3-319-11988-5_7","bibbaseid":"anonymous-adynamicpivotingalgorithmbasedonspatialapproximationindexes-2014","urls":{},"downloads":0,"html":""},"search_terms":["dynamic","pivoting","algorithm","based","spatial","approximation","indexes"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}