Sciweavers

4850 search results - page 339 / 970
» Approximate Data Structures with Applications
Sort
View
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
16 years 10 days ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba
SEDE
2010
15 years 4 months ago
Metadata Services for Distributed Event Stream Processing Agents
Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such ...
Mahesh B. Chaudhari, Suzanne W. Dietrich
SEMWEB
2009
Springer
16 years 1 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
16 years 8 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
WWW
2006
ACM
16 years 7 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...