Sciweavers

2370 search results - page 369 / 474
» A Structured Set of Higher-Order Problems
Sort
View
SIGMOD
2009
ACM
148views Database» more  SIGMOD 2009»
14 years 10 months ago
Combining keyword search and forms for ad hoc querying of databases
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan...
SIGMOD
2006
ACM
125views Database» more  SIGMOD 2006»
14 years 10 months ago
A non-linear dimensionality-reduction technique for fast similarity search in large databases
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
14 years 10 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 10 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 10 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...