Sciweavers

48 search results - page 4 / 10
» Investigations in tree locking for compiled database applica...
Sort
View
FROCOS
2007
Springer
14 years 1 months ago
Languages Modulo Normalization
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:...
Hitoshi Ohsaki, Hiroyuki Seki
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 9 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
EUROPAR
2001
Springer
14 years 3 days ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
INTERSPEECH
2010
13 years 2 months ago
Modeling liaison in French by using decision trees
French is known to be a language with major pronunciation irregularities at word endings with consonants. Particularly, the well-known phonetic phenomenon called Liaison is one of...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas