Sciweavers

765 search results - page 125 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
CSR
2007
Springer
15 years 4 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
15 years 2 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
CVPR
2000
IEEE
15 years 12 months ago
Integrating Color, Texture, and Geometry for Image Retrieval
This paper examines the problem of image retrieval from large, heterogeneous image databases. We present a technique that fulfills several needs identified by surveying recent res...
Nicholas R. Howe, Daniel P. Huttenlocher
DASFAA
2005
IEEE
106views Database» more  DASFAA 2005»
15 years 3 months ago
Real Datasets for File-Sharing Peer-to-Peer Systems
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signiï...
Shen-Tat Goh, Panos Kalnis, Spiridon Bakiras, Kian...
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 4 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...