Sciweavers

591 search results - page 38 / 119
» The complexity of XPath query evaluation
Sort
View
DILS
2005
Springer
14 years 2 months ago
BioNavigation: Selecting Optimum Paths Through Biological Resources to Evaluate Ontological Navigational Queries
Publicly available biological resources form a complex maze of highly heterogeneous data sources, interconnected by navigational capabilities and applications. Although it offers ...
Zoé Lacroix, Kaushal Parekh, Maria-Esther V...
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
14 years 6 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
JCSS
2008
120views more  JCSS 2008»
13 years 8 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
SIGMETRICS
2010
ACM
156views Hardware» more  SIGMETRICS 2010»
13 years 7 months ago
A query language and runtime tool for evaluating behavior of multi-tier servers
As modern multi-tier systems are becoming increasingly large and complex, it becomes more difficult for system analysts to understand the overall behavior of the system, and diag...
Saeed Ghanbari, Gokul Soundararajan, Cristiana Amz...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 8 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...