Sciweavers

1778 search results - page 200 / 356
» The Theory of Probabilistic Databases
Sort
View
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 6 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
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 4 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
IDEAS
2009
IEEE
111views Database» more  IDEAS 2009»
15 years 11 months ago
Semantics of a runtime adaptable transaction manager
Database Management Systems (DBMSs) that can be tailored to specific requirements offer the potential to improve reliability and maintainability and simultaneously the ability t...
Florian Irmert, Frank Lauterwald, Christoph P. Neu...
159
Voted
WWW
2009
ACM
16 years 5 months ago
Mapping the world's photos
We investigate how to organize a large collection of geotagged photos, working with a dataset of about 35 million images collected from Flickr. Our approach combines content analy...
David J. Crandall, Lars Backstrom, Daniel P. Hutte...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 5 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche