Sciweavers

3020 search results - page 51 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
SPIRE
2005
Springer
15 years 7 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
136
Voted
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 6 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
15 years 8 months ago
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R...
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 5 months ago
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
Manal El Dick, Esther Pacitti, Bettina Kemme
ER
2008
Springer
123views Database» more  ER 2008»
15 years 3 months ago
Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
Lipyeow Lim, Haixun Wang, Min Wang