Sciweavers

2338 search results - page 87 / 468
» Using UML to model relational database operations
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 11 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— 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...
Dan Olteanu, Jiewen Huang, Christoph Koch
FOCS
2008
IEEE
15 years 11 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
16 years 5 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
SIGMOD
2000
ACM
164views Database» more  SIGMOD 2000»
15 years 8 months ago
A Data Model and Data Structures for Moving Objects Databases
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...
Luca Forlizzi, Ralf Hartmut Güting, Enrico Na...
DATESO
2004
100views Database» more  DATESO 2004»
15 years 5 months ago
Storage and Retrieval of First Order Logic Terms in a Database
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
Peter Gurský