Sciweavers

568 search results - page 50 / 114
» Query by table
Sort
View
WIDM
2004
ACM
15 years 3 months ago
A comprehensive solution to the XML-to-relational mapping problem
The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable da...
Sihem Amer-Yahia, Fang Du, Juliana Freire
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 3 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
ICASSP
2009
IEEE
15 years 4 months ago
Improving multi-lattice alignment based spoken keyword spotting
In previous work, we showed that using a lattice instead of the 1-best path to represent both the query and the utterance being searched is beneficial for spoken keyword spotting...
Hui Lin, Alex Stupakov, Jeff Bilmes
HOTOS
2003
IEEE
15 years 3 months ago
One Hop Lookups for Peer-to-Peer Overlays
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 9 days ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu