SIGMOD 2007 - PDF Preprint Papers

SIGMOD 2007 International Conference on Management of Data

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIGMOD-2007 Paper

100

click to vote

SIGMOD
2007
ACM

413views Database» more SIGMOD 2007»

Effective keyword-based selection of relational databases

14 years 11 months ago

Download www.comp.nus.edu.sg

The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, mo...

Bei Yu, Guoliang Li, Karen R. Sollins, Anthony K. ...

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	413	Effective keyword-based selection of relational databases	claim
2	232	BLINKS: ranked keyword searches on graphs	claim
3	229	Spark: top-k keyword query in relational databases	claim
4	225	From complete to incomplete information and back	claim
5	224	Design of flash-based DBMS: an in-page logging approach	claim
6	219	Efficient exploitation of similar subexpressions for query processing	claim
7	211	Efficient algorithms for evaluating xpath over streams	claim
8	207	MySearchView: a customized metasearch engine generator	claim
9	198	Addressing diverse user preferences in SQL-query-result navigation	claim
10	197	Automated and on-demand provisioning of virtual machines for database applications	claim
11	196	Adaptive location constraint processing	claim
12	196	GPUQP: query co-processing using graphics processors	claim
13	195	Effective variation management for pseudo periodical streams	claim
14	192	Benchmarking declarative approximate selection predicates	claim
15	190	XANADUE: a system for detecting changes to XML data in tree-unaware relational databases	claim
16	190	Map-reduce-merge: simplified relational data processing on large clusters	claim
17	188	Intel Mash Maker: join the web	claim
18	188	Keyword search on relational data streams	claim
19	187	P-ring: an efficient and robust P2P range index structure	claim
20	186	Fg-index: towards verification-free query processing on graph databases	claim
21	186	An efficient and accurate method for evaluating time series similarity	claim
22	183	Report on the First International VLDB Workshop on Clean Databases (CleanDB 2006)	claim
23	183	Leveraging aggregate constraints for deduplication	claim
24	181	Progressive and selective merge: computing top-k with ad-hoc ranking functions	claim
25	179	How to barter bits for chronons: compression and bandwidth trade offs for database scans	claim
26	178	Quality is in the eye of the beholder: towards user-centric web-databases	claim
27	176	URank: formulation and efficient evaluation of top-k queries in uncertain databases	claim
28	174	The microsoft data platform	claim
29	174	ADO.NET entity framework: raising the level of abstraction in data programming	claim
30	172	Auditing disclosure by relevance ranking	claim
31	170	Cardinality estimation using sample views with quality assurance	claim
32	169	Scalable approximate query processing with the DBO engine	claim
33	169	ConEx: a system for monitoring queries	claim
34	169	Genome-scale disk-based suffix tree indexing	claim
35	168	In-network execution of monitoring queries in sensor networks	claim
36	167	A critical look at the TAB benchmark for physical design tools	claim
37	167	Data currency in replicated DHTs	claim
38	166	Threats to privacy in the forensic analysis of database systems	claim
39	165	Sharing aggregate computation for distributed queries	claim
40	165	Statistical analysis of sketch estimators	claim
41	164	Fast data stream algorithms using associative memories	claim
42	162	Effective and efficient update of xml in RDBMS	claim
43	161	Homeviews: peer-to-peer middleware for personal data sharing applications	claim
44	160	AutoDomainMine: a graphical data mining system for process optimization	claim
45	160	Cayuga: a high-performance event processing engine	claim
46	160	Supporting ranking and clustering as generalized order-by and group-by	claim
47	159	Boosting topic-based publish-subscribe systems with dynamic clustering	claim
48	159	Anatomy of the ADO.NET entity framework	claim
49	158	Log-based recovery for middleware servers	claim
50	157	Leveraging data and structure in ontology integration	claim
51	157	DaNaLIX: a domain-adaptive natural language interface for querying XML	claim
52	157	Compiling mappings to bridge applications and databases	claim
53	156	Mashup Feeds: : continuous queries over web services	claim
54	156	M-invariance: towards privacy preserving re-publication of dynamic datasets	claim
55	156	JouleSort: a balanced energy-efficiency benchmark	claim
56	153	Scaling games to epic proportion	claim
57	151	The case for a wide-table approach to manage sparse relational data sets	claim
58	150	System design issues in sensor databases	claim
59	150	Exploiting self-monitoring sample views for cardinality estimation	claim
60	149	A data-oriented survey of context models	claim
61	149	BIwTL: a business information warehouse toolkit and language for warehousing simplification and automation	claim
62	149	Mobile and embedded databases	claim
63	147	Extending relational query optimization to dynamic schemas for information integration in multidatabases	claim
64	146	Distributed query evaluation with performance guarantees	claim
65	145	Why off-the-shelf RDBMSs are better at XPath than you might expect	claim
66	144	The TopX DB&IR engine	claim
67	144	Efficient xml data dissemination with piggybacking	claim
68	144	GhostDB: querying visible and hidden data without leaks	claim
69	143	Simple off the shelf abstractions for XML schema	claim
70	142	Fast and practical indexing and querying of very large graphs	claim
71	141	Assisted querying using instant-response interfaces	claim
72	141	Storage workload estimation for database management systems	claim
73	138	Developmental informatics at IIT Bombay	claim
74	137	Intensional associations between data and metadata	claim
75	136	Community systems research at Yahoo!	claim
76	136	Event processing using database technology	claim
77	136	Progressive optimization in a shared-nothing parallel database	claim
78	135	XTream: personal data streams	claim
79	134	Database research opportunities in computer games	claim
80	134	Updating a cracked database	claim
81	133	Sketching probabilistic data streams	claim
82	133	Making database systems usable	claim
83	132	A dynamic and flexible sensor network platform	claim
84	128	A SQL: 1999 code generator for the pathfinder xquery compiler	claim
85	125	K-relevance: a spectrum of relevance for data sources impacting a query	claim
86	125	Identifying meaningful return information for XML keyword search	claim
87	125	Optimizing mpf queries: decision support and probabilistic inference	claim
88	124	Querying xml with update syntax	claim
89	124	Query suspend and resume	claim
90	124	CLIDE: interactive query formulation for service oriented architectures	claim
91	123	Schema advisor for hybrid relational-XML DBMS	claim
92	122	XQuery layers	claim
93	121	EaseDB: a cache-oblivious in-memory query processor	claim
94	121	Execution strategies for SQL subqueries	claim
95	120	Xpath on steroids: exploiting relational engines for xpath performance	claim
96	115	Privacy preserving schema and data matching	claim
97	114	Managing information quality in e-science: the qurator workbench	claim
98	112	A random walk approach to sampling hidden databases	claim
99	111	User-centric personalized extensibility for data-driven web applications	claim
100	111	Query relaxation using malleable schemas	claim
101	110	Report on the First International Workshop on Database Preservation (PresDB'07)	claim
102	109	Query-based monitoring of BPEL business processes	claim
103	108	Travel time estimation using NiagaraST and latte	claim
104	108	Provenance in databases	claim
105	106	Highly distributed XQuery with DXQ	claim
106	106	Massively multi-query join processing in publish/subscribe systems	claim
107	105	Nulls, three-valued logic, and ambiguity in SQL: critiquing date's critique	claim
108	105	An XML transaction processing benchmark	claim
109	105	Sonnet: an efficient distributed content-based dissemination broker	claim
110	105	Supporting entity search: a large-scale prototype search engine	claim
111	102	Finding shapes in a set of points	claim
112	98	Model management 2.0: manipulating richer mappings	claim
113	96	Static analysis of XML processing with data values	claim
114	96	MashMaker: mashups for the masses	claim
115	91	Indexing dataspaces	claim
116	86	Frequently-asked questions about double-blind reviewing	claim
117	85	Navigational XPath: calculus and algebra	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers