Sciweavers

2124 search results - page 183 / 425
» Aggregating time partitions
Sort
View
PVLDB
2010
121views more  PVLDB 2010»
14 years 11 months ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
ICONFERENCE
2012
13 years 11 months ago
No forests without trees: particulars and patterns in visualizing personal communication
When people use visualizations of conversational archives, they typically reflect on particular events, rather than patterns of activity over time. We explore whether this is a fu...
Ou Jie Zhao, Tiffany Ng, Dan Cosley
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 4 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
161
Voted
MSWIM
2003
ACM
15 years 9 months ago
On the application of traffic engineering over bluetooth ad hoc networks
The seamless communication of data and voice over short-range, point-to-multipoint wireless links between mobile and/or stationary devices is becoming a reality by newly introduce...
Sachin Abhyankar, Rishi Toshniwal, Carlos de M. Co...
188
Voted
TKDE
2002
148views more  TKDE 2002»
15 years 3 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...