Sciweavers

294 search results - page 42 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
SIGMOD
2009
ACM
114views Database» more  SIGMOD 2009»
15 years 9 months ago
A framework for testing query transformation rules
In order to enable extensibility, modern query optimizers typically leverage a transformation rule based framework. Testing individual rule correctness as well as correctness of r...
Hicham G. Elmongui, Vivek R. Narasayya, Ravishanka...
JSS
2008
68views more  JSS 2008»
14 years 9 months ago
An efficient iconic indexing strategy for image rotation and reflection in image databases
Spatial relationships are important issues for similarity-based retrieval in many image database applications. With the popularity of digital cameras and the related image process...
Wei-Horng Yeh, Ye-In Chang
WWW
2008
ACM
15 years 10 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Computational Method for Temporal Pattern Discovery in Biomedical Genomic Databases
With the rapid growth of biomedical research databases, opportunities for scientific inquiry have expanded quickly and led to a demand for computational methods that can extract b...
Mohammed I. Rafiq, Martin J. O'Connor, Amar K. Das
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
15 years 9 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner