Sciweavers

24132 search results - page 4818 / 4827
» and 2009
Sort
View
156
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
PODS
2009
ACM
124views Database» more  PODS 2009»
15 years 10 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...
MOBISYS
2009
ACM
15 years 10 months ago
Point&Connect: intention-based device pairing for mobile phone users
Point&Connect (P&C) offers an intuitive and resilient device pairing solution on standard mobile phones. Its operation follows the simple sequence of point-and-connect: wh...
Chunyi Peng, Guobin Shen, Yongguang Zhang, Songwu ...
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
15 years 9 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
« Prev « First page 4818 / 4827 Last » Next »