Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- technical-noteNovember 2009
LuposDate: a semantic web database system
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 2083–2084https://doi.org/10.1145/1645953.1646313Managing and querying Semantic Web are important issues for Semantic Web applications. Therefore, we have developed a Semantic Web database system with logically and physically optimized SPARQL engines to manage and query RDF data, named LuposDate. In ...
- technical-noteNovember 2009
M-COPE: a multiple continuous query processing engine
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 2065–2066https://doi.org/10.1145/1645953.1646303A data stream management system (DSMS) should support an efficient evaluation scheme for long-running continuous queries over infinite data streams. This demonstration presents a scalable query processing engine, M-COPE (Multiple Continuous Query ...
- posterNovember 2009
Privacy without noise
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1517–1520https://doi.org/10.1145/1645953.1646160This paper presents several results on statistical database privacy. We first point out a serious vulnerability in a widely-accepted approach which perturbs query results with additive noise. We then show that for sum queries which aggregate across all ...
-
- posterNovember 2009
Scalable indexing of RDF graphs for efficient join processing
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1513–1516https://doi.org/10.1145/1645953.1646159Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structures. Weak data locality negatively impacts storage and query processing ...
- posterNovember 2009
Multidimensional routing indices for efficient distributed query processing
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1489–1492https://doi.org/10.1145/1645953.1646153Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the number of documents that can be obtained in a certain direction in the ...
- posterNovember 2009
Effective anonymization of query logs
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1465–1468https://doi.org/10.1145/1645953.1646146User search query logs have proven to be very useful, but have vast potential for misuse. Several incidents have shown that simple removal of identifiers is insufficient to protect the identity of users. Publishing such inadequately anonymized data can ...
- posterNovember 2009
Progressive skyline query evaluation and maintenance in wireless sensor networks
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1445–1448https://doi.org/10.1145/1645953.1646141Skyline query has been received much attention due to its wide application backgrounds for multi-preference and decision making. In this paper we consider skyline query evaluation and maintenance in wireless sensor networks. We devise an evaluation ...
- posterNovember 2009
Walking in the crowd: anonymizing trajectory data for pattern analysis
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1441–1444https://doi.org/10.1145/1645953.1646140Recently, trajectory data mining has received a lot of attention in both the industry and the academic research. In this paper, we study the privacy threats in trajectory data publishing and show that traditional anonymization methods are not applicable ...
- posterNovember 2009
Group-by skyline query processing in relational engines
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1433–1436https://doi.org/10.1145/1645953.1646138The skyline operator was first proposed in 2001 for retrieving interesting tuples from a dataset. Since then, 100+ skyline-related papers have been published; however, we discovered that one of the most intuitive and practical type of skyline queries, ...
- posterNovember 2009
Minimal common container of tree patterns
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1409–1412https://doi.org/10.1145/1645953.1646132Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patterns P1, ..., Pn, there exists another pattern P (tree pattern or DAG-pattern)...
- research-articleNovember 2009
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1037–1046https://doi.org/10.1145/1645953.1646085Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been extensively applied in this context. The model seeks a generalization scheme ...
- research-articleNovember 2009
Efficient joins with compressed bitmap indexes
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 1017–1026https://doi.org/10.1145/1645953.1646083We present a new class of adaptive algorithms that use compressed bitmap indexes to speed up evaluation of the range join query in relational databases. We determine the best strategy to process a join query based on a fast sub-linear time computation ...
- panelNovember 2009
Information extraction meets relation databases
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Page 897https://doi.org/10.1145/1645953.1646067Information extraction from unstructured text has much in common with querying in databases systems. Despite some differences on how data is modeled or represented, the general goal remains the same, i.e. to retrieve data or tag elements that satisfy ...
- research-articleNovember 2009
Efficient join processing on uncertain data streams
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 857–866https://doi.org/10.1145/1645953.1646062Join processing in the streaming environment has many practical applications such as data cleaning and outlier detection. Due to the inherent uncertainty in the real-world data, it has become an increasingly important problem to consider the join ...
- research-articleNovember 2009
A code generation approach to optimizing high-performance distributed data stream processing
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 847–856https://doi.org/10.1145/1645953.1646061We present a code-generation-based optimization approach to bringing performance and scalability to distributed stream processing applications. We express stream processing applications using an operator-based, stream-centric language called SPADE, ...
- research-articleNovember 2009
A signal-to-noise approach to score normalization
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 797–806https://doi.org/10.1145/1645953.1646055Score normalization is indispensable in distributed retrieval and fusion or meta-search where merging of result-lists is required. Distributional approaches to score normalization with reference to relevance, such as binary mixture models like the ...
- research-articleNovember 2009
Navigational path privacy protection: navigational path privacy protection
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 691–700https://doi.org/10.1145/1645953.1646041Navigational path query, one of the most popular location-based services (LBSs), determines a route from a source to a destination on a road network. However, issuing path queries to some non-trustworthy service providers may pose privacy threats to the ...
- research-articleNovember 2009
Provenance query evaluation: what's so special about it?
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementNovember 2009, Pages 681–690https://doi.org/10.1145/1645953.1646040While provenance has been extensively studied in the literature, the efficient evaluation of provenance queries remains an open problem. Traditional query optimization techniques, like the use of general-purpose indexes, or the materialization of ...