Sciweavers

3368 search results - page 26 / 674
» The Complexity of Query Reliability
Sort
View
BMCBI
2006
145views more  BMCBI 2006»
13 years 7 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 7 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 9 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
EUROPAR
2008
Springer
13 years 9 months ago
Complex Queries for Moving Object Databases in DHT-Based Systems
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
Cecilia Hernández, M. Andrea Rodrígu...
SPAA
2003
ACM
14 years 24 days ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith