Sciweavers

620 search results - page 121 / 124
» Optimizing Path Expression Queries of XML Data
Sort
View
PPPJ
2009
ACM
14 years 2 months ago
Phase detection using trace compilation
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
Christian Wimmer, Marcelo Silva Cintra, Michael Be...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
BMCBI
2002
129views more  BMCBI 2002»
13 years 7 months ago
SeqHound: biological sequence and structure database as a platform for bioinformatics research
Background: SeqHound has been developed as an integrated biological sequence, taxonomy, annotation and 3-D structure database system. It provides a high-performance server platfor...
Katerina Michalickova, Gary D. Bader, Michel Dumon...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 22 days ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
PVLDB
2008
146views more  PVLDB 2008»
13 years 7 months ago
Graceful database schema evolution: the PRISM workbench
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo