Sciweavers

75 search results - page 12 / 15
» Comparing Nested GPSJ Queries in Multidimensional Databases
Sort
View
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 5 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...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
13 years 9 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
BMCBI
2008
121views more  BMCBI 2008»
13 years 5 months ago
OntoDas - a tool for facilitating the construction of complex queries to the Gene Ontology
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...
Kieran O'Neill, Alexander García Castro, An...
CIKM
2006
Springer
13 years 9 months ago
Cache-oblivious nested-loop joins
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
Bingsheng He, Qiong Luo
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 8 days ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer