Sciweavers

2859 search results - page 109 / 572
» Querying Complex Structured Databases
Sort
View
BTW
1993
Springer
193views Database» more  BTW 1993»
14 years 8 days ago
Query Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
Christian Rich, Marc H. Scholl
BIBE
2003
IEEE
14 years 1 months ago
Requirements of Phylogenetic Databases
We examine the organizational impact on phylogenetic databases of the increasing sophistication in the need and use of phylogenetic data. A primary issue is the use of the unnorma...
Luay Nakhleh, Daniel P. Miranker, François ...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 3 months ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...
ICDCS
2005
IEEE
14 years 1 months ago
Similarity Searching in Peer-to-Peer Databases
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
Indrajit Bhattacharya, Srinivas R. Kashyap, Sriniv...
CDES
2008
123views Hardware» more  CDES 2008»
13 years 9 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...