Sciweavers

2001 search results - page 332 / 401
» Indexing in a Hypertext Database
Sort
View
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
14 years 1 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
ACMICEC
2007
ACM
144views ECommerce» more  ACMICEC 2007»
14 years 1 months ago
Needs-based analysis of online customer reviews
Needs-based analysis lies at the intersection of product marketing and new product development. It is the study of why consumers purchase and what they do with those purchases. In...
Thomas Y. Lee
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
14 years 1 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
DEXA
2004
Springer
159views Database» more  DEXA 2004»
14 years 21 days ago
Adaptive Double Routing Indices: Combining Effectiveness and Efficiency in P2P Systems
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to informati...
Stéphane Bressan, Achmad Nizar Hidayanto, C...
DEXA
2004
Springer
112views Database» more  DEXA 2004»
14 years 21 days ago
Efficient Algorithms for Multi-file Caching
Multi-File Caching issues arise in applications where a set of jobs are processed and each job requests one or more input files. A given job can only be started if all its input fi...
Ekow J. Otoo, Doron Rotem, Sridhar Seshadri