Sciweavers

398 search results - page 32 / 80
» Query by output
Sort
View
80
Voted
EDBTW
2006
Springer
15 years 1 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
AAAI
1996
14 years 11 months ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
12 years 12 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
JCDL
2004
ACM
170views Education» more  JCDL 2004»
15 years 3 months ago
Looking for new, not known music only: music retrieval by melody style
With the growth of digital music, content-based music retrieval (CBMR) has attracted increasingly attention. For most CBMR systems, the task is to return music objects similar to ...
Fang-Fei Kuo, Man-Kwan Shan
COOPIS
1998
IEEE
15 years 1 months ago
Wrapper Generation for Web Accessible Data Sources
There is an increase in the number of data sources that can be queried across the WWW. Such sources typically support HTML forms-based interfaces and search engines query collecti...
Jean-Robert Gruser, Louiqa Raschid, Maria-Esther V...