Sciweavers

2121 search results - page 353 / 425
» Indexing Incomplete Databases
Sort
View
130
Voted
VLDB
1999
ACM
133views Database» more  VLDB 1999»
15 years 6 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
112
Voted
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 6 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
142
Voted
ACMICEC
2007
ACM
144views ECommerce» more  ACMICEC 2007»
15 years 6 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
132
Voted
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
15 years 6 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
120
Voted
DEXA
2004
Springer
159views Database» more  DEXA 2004»
15 years 6 months 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...