Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
This paper describes a method for constructing feature landmark database using omnidirectional videos and GPS positions acquired in outdoor environments. The feature landmark data...
Sei Ikeda, Tomokazu Sato, Koichiro Yamaguchi, Naok...
The number of specialized databases in molecular biology is growing fast, as is the availability of molecular data. These trends necessitate the development of automatic methods fo...
Transaction time databases retain and provide access to prior states of a database. An update “inserts” a new record while preserving the old version. Immortal DB builds trans...
David B. Lomet, Roger S. Barga, Mohamed F. Mokbel,...