PVLDB 2008 - PDF Preprint Papers

PVLDB 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PVLDB-2008 Paper

click to vote

PVLDB
2008

232views more PVLDB 2008»

FINCH: evaluating reverse k-Nearest-Neighbor queries on location data

13 years 2 months ago

Download www.comp.nus.edu.sg

A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...

Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	232	FINCH: evaluating reverse k-Nearest-Neighbor queries on location data	claim
2	216	Ad-hoc data processing in the cloud	claim
3	205	Making SENSE: socially enhanced search and exploration	claim
4	201	Ed-Join: an efficient algorithm for similarity joins with edit distance constraints	claim
5	197	Dynamic partitioning of the cache hierarchy in shared data centers	claim
6	182	SCOPE: easy and efficient parallel processing of massive data sets	claim
7	174	Relaxation in text search using taxonomies	claim
8	173	AJAXSearch: crawling, indexing and searching web 2.0 applications	claim
9	170	Data exchange with data-metadata translations	claim
10	167	Managing and querying transaction-time databases under schema evolution	claim
11	167	Keyword search on external memory data graphs	claim
12	163	C-DEM: a multi-modal query system for Drosophila Embryo databases	claim
13	163	AlvisP2P: scalable peer-to-peer text retrieval in a structured P2P network	claim
14	160	BayesStore: managing large, uncertain data repositories with probabilistic graphical models	claim
15	157	SEDA: a system for search, exploration, discovery, and analysis of XML Data	claim
16	156	eXtract: a snippet generation system for XML search	claim
17	154	Indexing land surface for efficient kNN query	claim
18	150	Privacy preserving serial data publishing by role composition	claim
19	148	StreamTX: extracting tuples from streaming XML data	claim
20	146	Graceful database schema evolution: the PRISM workbench	claim
21	146	Efficient search for the top-k probable nearest neighbors in uncertain databases	claim
22	146	Resisting structural re-identification in anonymized social networks	claim
23	144	Mining search engine query logs via suggestion sampling	claim
24	141	WebTables: exploring the power of tables on the web	claim
25	138	A skip-list approach for efficiently processing forecasting queries	claim
26	138	Authenticating the query results of text search engines	claim
27	137	EasyTicket: a ticket routing recommendation engine for enterprise problem resolution	claim
28	137	Flashing up the storage layer	claim
29	136	Keyword query cleaning	claim
30	134	Reasoning and identifying relevant matches for XML keyword search	claim
31	134	Evita raced: metacompilation for declarative networks	claim
32	132	Access control over uncertain data	claim
33	131	Learning to create data-integrating queries	claim
34	130	Analyzing and revising data integration schemas to improve their matchability	claim
35	128	Brighthouse: an analytic data warehouse for ad-hoc queries	claim
36	128	Hexastore: sextuple indexing for semantic web data management	claim
37	128	Implementing filesystems by tree-aware DBMSs	claim
38	127	Discovering data quality rules	claim
39	127	Hashed samples: selectivity estimators for set similarity selection queries	claim
40	126	Parallelizing query optimization	claim
41	126	Dwarfs in the rearview mirror: how big are they really?	claim
42	124	Google's Deep Web crawl	claim
43	124	Scheduling shared scans of large data files	claim
44	124	DBPubs: multidimensional exploration of database publications	claim
45	123	Propagating functional dependencies with conditions	claim
46	123	Dependable cardinality forecasts for XQuery	claim
47	123	Efficient implementation of sorting on multi-core SIMD CPU architecture	claim
48	122	Identifying robust plans through plan diagram reduction	claim
49	122	Structural signatures for tree data structures	claim
50	122	Exploiting shared correlations in probabilistic databases	claim
51	121	Type inference and type checking for queries on execution traces	claim
52	121	QueryScope: visualizing queries for repeatable database tuning	claim
53	120	On the provenance of non-answers to queries over extracted data	claim
54	119	Comparing and evaluating mapping systems with STBenchmark	claim
55	118	Column-store support for RDF data management: not all swans are white	claim
56	118	XTCcmp: XQuery compilation on XTC	claim
57	118	Efficient top-k processing over query-dependent functions	claim
58	117	Learning to extract form labels	claim
59	117	Interactive source registration in community-oriented information integration	claim
60	116	Accuracy estimate and optimization techniques for SimRank computation	claim
61	116	Tighter estimation using bottom k sketches	claim
62	116	Anonymizing bipartite graph data using safe groupings	claim
63	115	XML Structural Summaries	claim
64	113	Rewriting procedures for batched bindings	claim
65	112	P2P logging and timestamping for reconciliation	claim
66	111	Semandaq: a data quality system based on conditional functional dependencies	claim
67	111	A benchmark for evaluating moving object indexes	claim
68	111	Approximate lineage for probabilistic databases	claim
69	110	Online maintenance of very large random samples on flash storage	claim
70	110	Fault-tolerant stream processing using a distributed, replicated file system	claim
71	110	DObjects: enabling distributed data services for metacomputing platforms	claim
72	108	Taming verification hardness: an efficient algorithm for testing subgraph isomorphism	claim
73	108	Sliding-window top-k queries on uncertain streams	claim
74	107	A pay-as-you-go framework for query execution feedback	claim
75	107	Finding relevant patterns in bursty sequences	claim
76	107	XTreeNet: democratic community search	claim
77	107	Constrained locally weighted clustering	claim
78	106	Automated creation of a forms-based database query interface	claim
79	106	A revival of integrity constraints for data cleaning	claim
80	105	Finding frequent items in data streams	claim
81	105	Transaction time indexing with version compression	claim
82	104	Scalable multi-query optimization for exploratory queries over federated scientific databases	claim
83	104	Efficient skyline querying with variable user preferences on nominal attributes	claim
84	103	A request-routing framework for SOA-based enterprise computing	claim
85	101	Output perturbation with query relaxation	claim
86	101	Multidimensional content eXploration	claim
87	100	Efficiently approximating query optimizer plan diagrams	claim
88	100	Scalable query result caching for web applications	claim
89	99	AuditGuard: a system for database auditing under retention restrictions	claim
90	99	Industry-scale duplicate detection	claim
91	98	Performance profiling with EndoScope, an acquisitional software monitoring framework	claim
92	98	Web page language identification based on URLs	claim
93	96	H-store: a high-performance, distributed main memory transaction processing system	claim
94	94	Dynamic active probing of helpdesk databases	claim
95	93	Querying and mining of time series data: experimental comparison of representations and distance measures	claim
96	93	Large-scale collaborative analysis and extraction of web data	claim
97	93	On generating near-optimal tableaux for conditional functional dependencies	claim
98	92	Is transactional memory an oxymoron?	claim
99	90	Generating XML structure using examples and constraints	claim
100	90	Sorting hierarchical data in external memory for archiving	claim
101	89	ManyAspects: a system for highlighting diverse concepts in documents	claim
102	89	Constrained physical design tuning	claim
103	85	Scalable ad-hoc entity extraction from text collections	claim
104	84	When is it time to rethink the aggregate configuration of your OLAP server?	claim
105	83	Clustera: an integrated computation and data management system	claim
106	83	Incompleteness in information integration	claim
107	82	TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering	claim
108	82	Mining non-redundant high order correlations in binary data	claim
109	82	STBenchmark: towards a benchmark for mapping systems	claim
110	81	A first tutorial on dataspaces	claim
111	81	On efficiently searching trajectories and archival data for historical similarities	claim
112	81	Optimization of multi-domain queries on the web	claim
113	79	RDF-3X: a RISC-style engine for RDF	claim
114	77	Efficient network aware search in collaborative tagging sites	claim
115	77	Towards a streaming SQL standard	claim
116	77	Community-driven data grids	claim
117	74	Out-of-order processing: a new architecture for high-performance stream systems	claim
118	72	Ontologies and databases: myths and challenges	claim
119	72	The V*-Diagram: a query-dependent approach to moving KNN queries	claim
120	72	Process spaceship: discovering and exploring process views from event logs in data spaces	claim
121	71	A practical scalable distributed B-tree	claim
122	71	Read-optimized databases, in depth	claim
123	71	Organizing and indexing non-convex regions	claim
124	66	Plan-based complex event detection across distributed sources	claim
125	62	RIDE: a tool for interactive source registration in community-oriented information integration	claim
126	61	PNUTS: Yahoo!'s hosted data serving platform	claim
127	58	Scalable ranked publish/subscribe	claim
128	49	WYSIWYG development of data driven web applications	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers