Sciweavers

27 search results - page 4 / 6
» Using an index of precomputed joins in order to speed up SPA...
Sort
View
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
14 years 20 days ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 22 days ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
BMCBI
2008
142views more  BMCBI 2008»
13 years 7 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 4 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen