Sciweavers

664 search results - page 9 / 133
» Generalized Search Trees for Database Systems
Sort
View
CIKM
2001
Springer
15 years 5 months ago
SQL Database Primitives for Decision Tree Classifiers
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data ...
Kai-Uwe Sattler, Oliver Dunemann
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 4 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 6 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 7 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
AAAI
2000
15 years 3 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri