Sciweavers

2070 search results - page 323 / 414
» Querying Communities in Relational Databases
Sort
View
72
Voted
AAAI
1996
15 years 12 days ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld
98
Voted
TOG
2010
181views more  TOG 2010»
14 years 5 months ago
Context-based search for 3D models
Large corpora of 3D models, such as Google 3D Warehouse, are now becoming available on the web. It is possible to search these databases using a keyword search. This makes it poss...
Matthew Fisher, Pat Hanrahan
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 11 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
94
Voted
VLDB
2004
ACM
144views Database» more  VLDB 2004»
15 years 4 months ago
Returning Modified Rows - SELECT Statements with Side Effects
SQL in the IBM® DB2® Universal Database™ for Linux®, UNIX®, and Windows® (DB2 UDB) database management product has been extended to support nested INSERT, UPDATE, and DELET...
Andreas Behm, Serge Rielau, Richard Swagerman
ICDT
2003
ACM
132views Database» more  ICDT 2003»
15 years 4 months ago
Probabilistic Interval XML
Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose th...
Edward Hung, Lise Getoor, V. S. Subrahmanian