146 search results - page 22 / 30 » Rewriting of Regular Expressions and Regular Path Queries |
177
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
204
click to vote
BMCBI
2002
15 years 5 months ago
2002
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...
165
click to vote
ICMCS
1999
IEEE
15 years 10 months ago
1999
IEEE
The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of m...
157
click to vote
FROCOS
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
183
click to vote
PVLDB
2008
15 years 5 months ago
2008
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...