Sciweavers

2514 search results - page 244 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
16 years 8 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 10 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
DBPL
1999
Springer
109views Database» more  DBPL 1999»
15 years 11 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
BIODATAMINING
2008
117views more  BIODATAMINING 2008»
15 years 6 months ago
Search extension transforms Wiki into a relational system: A case for flavonoid metabolite database
Background: In computer science, database systems are based on the relational model founded by Edgar Codd in 1970. On the other hand, in the area of biology the word 'databas...
Masanori Arita, Kazuhiro Suwa
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 6 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...