Sciweavers

5221 search results - page 245 / 1045
» An On-line Problem Database
Sort
View
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 10 months ago
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
V. W. Setzer, Andrea Zisman
DEXAW
2007
IEEE
157views Database» more  DEXAW 2007»
15 years 10 months ago
Dimensionality Reduction in a P2P System
Peers and data objects in the Hybrid Overlay Network (HON) are organized in a ndimensional feature space. As the dimensionality increases, peers and data objects become sparse and ...
Mouna Kacimi, Kokou Yétongnon
DEXAW
2004
IEEE
133views Database» more  DEXAW 2004»
15 years 10 months ago
ADUS: Indirect Generation of User Interfaces on Wireless Devices
Nowadays, there exists a great interest in wireless and mobile devices. However, the development of graphical user interfaces (GUIs) for applications in these environments must co...
Nikola Mitrovic, José A. Royo, Eduardo Mena
FQAS
2006
Springer
99views Database» more  FQAS 2006»
15 years 10 months ago
Partition-Based Approach to Processing Batches of Frequent Itemset Queries
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
Przemyslaw Grudzinski, Marek Wojciechowski, Maciej...
FQAS
2006
Springer
85views Database» more  FQAS 2006»
15 years 10 months ago
The Lookahead Principle for Preference Elicitation: Experimental Results
Preference-based search is the problem of finding an item that matches best with a user's preferences. User studies show that example-based tools for preference-based search c...
Paolo Viappiani, Boi Faltings, Pearl Pu