Sciweavers

654 search results - page 90 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
DBPL
2001
Springer
115views Database» more  DBPL 2001»
15 years 4 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen
ISBRA
2010
Springer
15 years 6 months ago
Modeling without Borders: Creating and Annotating VCell Models Using the Web
Biological research is becoming increasingly complex and data-rich, with multiple public databases providing a variety of resources: hundreds of thousands of substances and interac...
Michael L. Blinov, Oliver Ruebenacker, James C. Sc...
EDBT
2006
ACM
103views Database» more  EDBT 2006»
15 years 12 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 3 months ago
How schema independent are schema free query interfaces?
— Real-world databases often have extremely complex schemas. With thousands of entity types and relationships, each with a hundred or so attributes, it is extremely difficult fo...
Arash Termehchy, Marianne Winslett, Yodsawalai Cho...
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 5 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello