Sciweavers

312 search results - page 53 / 63
» Indexing Gapped-Factors Using a Tree
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
SEBD
2003
154views Database» more  SEBD 2003»
13 years 11 months ago
Management of User Preferences in Data Intensive Applications
Abstract. The management of user preferences is becoming a fundamental ingredient of modern Web-based data-intensive applications, in which information filtering is crucial to red...
Riccardo Torlone, Paolo Ciaccia
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 11 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
ICDE
2007
IEEE
163views Database» more  ICDE 2007»
14 years 11 months ago
Adding Context to Preferences
To handle the overwhelming amount of information currently available, personalization systems allow users to specify the information that interests them through preferences. Most ...
Kostas Stefanidis, Evaggelia Pitoura, Panos Vassil...
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
14 years 11 months ago
Simple, Robust and Highly Concurrent B-trees with Node Deletion
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
David B. Lomet