SIGMOD 2009 - PDF Preprint Papers

SIGMOD 2009 International Conference on Management of Data

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIGMOD-2009 Paper

click to vote

SIGMOD
2009
ACM

156views Database» more SIGMOD 2009»

Efficient approximate entity extraction with edit distance constraints

2 years 2 months ago

Download www.cse.unsw.edu.au

Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...

Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...

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	156	Efficient approximate entity extraction with edit distance constraints	claim
2	143	MobileMiner: a real world case study of data mining in mobile communication	claim
3	130	Continuous obstructed nearest neighbor queries in spatial databases	claim
4	127	Partial join order optimization in the paraccel analytic database	claim
5	88	DDE: from dewey to a fully dynamic XML labeling scheme	claim
6	81	What's on the grapevine?	claim
7	77	Keyword search in databases: the power of RDBMS	claim
8	77	Hermes: a travel through semantics on the data web	claim
9	75	Self-organizing tuple reconstruction in column-stores	claim
10	74	Efficient type-ahead search on relational data: a TASTIER approach	claim
11	73	MayBMS: a probabilistic database management system	claim
12	73	Dictionary-based order-preserving string compression for main memory column stores	claim
13	73	Indexing correlated probabilistic databases	claim
14	70	QoX-driven ETL design: reducing the cost of ETL consulting engagements	claim
15	69	A comparison of flexible schemas for software as a service	claim
16	69	Monitoring path nearest neighbor in road networks	claim
17	68	Interactive anonymization of sensitive data	claim
18	68	Interactive plan hints for query optimization	claim
19	67	Voyagers and voyeurs: supporting social data analysis	claim
20	63	Building search applications with Marklogic Server	claim
21	63	Exploring biomedical databases with BioNav	claim
22	62	Exploiting context analysis for combining multiple entity resolution systems	claim
23	61	Keyword search on structured and semi-structured data	claim
24	61	Query processing techniques for solid state drives	claim
25	61	Cost based plan selection for xpath	claim
26	60	Query segmentation using conditional random fields	claim
27	60	ZStream: a cost-based query processor for adaptively detecting composite events	claim
28	59	DejaVu: declarative pattern matching over live and archived streams of events	claim
29	59	Quality and efficiency in high dimensional nearest neighbor search	claim
30	59	Attacks on privacy and deFinetti's theorem	claim
31	59	A gauss function based approach for unbalanced ontology matching	claim
32	58	ELMR: lightweight mobile health records	claim
33	56	DBDOC: querying and browsing databases and interrelated documents	claim
34	56	Scalable skyline computation using object-based space partitioning	claim
35	55	Rethinking cost and performance of database systems	claim
36	55	Secure outsourced aggregation via one-way chains	claim
37	54	XML keyword query refinement	claim
38	54	3-HOP: a high-compression indexing scheme for reachability query	claim
39	53	Hierarchical result views for keyword queries over relational databases	claim
40	53	Estimating the confidence of conditional functional dependencies	claim
41	53	GAMPS: compressing multi sensor data by grouping and amplitude scaling	claim
42	53	PRIMA: archiving and querying historical data with evolving schemas	claim
43	53	Optimizing complex extraction programs over evolving text data	claim
44	51	Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason	claim
45	50	Automated SQL tuning through trial and (sometimes) error	claim
46	50	Efficient top-k algorithms for fuzzy search in string collections	claim
47	50	ORDEN: outlier region detection and exploration in sensor networks	claim
48	50	Database research in computer games	claim
49	49	Finding min-repros in database software	claim
50	49	Asynchronous view maintenance for VLSD databases	claim
51	49	Ranking distributed probabilistic data	claim
52	49	Minimizing the communication cost for continuous skyline maintenance	claim
53	48	Generic and effective semi-structured keyword search	claim
54	48	Simplifying XML schema: effortless handling of nondeterministic regular expressions	claim
55	48	MEDIALIFE: from images to a life chronicle	claim
56	48	FERRY: database-supported program execution	claim
57	48	Scalable join processing on very large RDF graphs	claim
58	48	Authenticated join processing in outsourced databases	claim
59	48	Combining keyword search and forms for ad hoc querying of databases	claim
60	47	Do we mean the same?: disambiguation of extracted keyword queries for database search	claim
61	47	Enabling enterprise mashups over unstructured text feeds with InfoSphere MashupHub and SystemT	claim
62	47	Secure kNN computation on encrypted databases	claim
63	47	HDSampler: revealing data behind web form interfaces	claim
64	46	Privacy preservation of aggregates in hidden databases: why and how?	claim
65	46	A common database approach for OLTP and OLAP using an in-memory column database	claim
66	45	Top-k queries on uncertain data: on score distribution and typical answers	claim
67	45	Entity resolution with iterative blocking	claim
68	45	ROX: run-time optimization of XQueries	claim
69	45	Design for interaction	claim
70	44	Advances in flash memory SSD technology for enterprise database applications	claim
71	44	Incremental maintenance of length normalized indexes for approximate string matching	claim
72	43	CourseRank: a social system for course planning	claim
73	43	Dependency-aware reordering for parallelizing query optimization in multi-core CPUs	claim
74	43	Peta-scale data warehousing at Yahoo!	claim
75	43	DataLens: making a good first impression	claim
76	42	Data integration in mashups	claim
77	42	Keyword query cleaning using hidden Markov models	claim
78	42	Extending autocompletion to tolerate errors	claim
79	42	Building community-centric information exploration applications on social content sites	claim
80	42	Distributed data-parallel computing using a high-level programming language	claim
81	42	Generating example data for dataflow programs	claim
82	42	FlashLogging: exploiting flash devices for synchronous logging performance	claim
83	41	Logical foundations of relational data exchange	claim
84	41	How is the weather tomorrow?: towards a benchmark for the cloud	claim
85	41	Kernel-based skyline cardinality estimation	claim
86	41	Cross-tier, label-based security enforcement for web applications	claim
87	40	Query-aware shrinking test databases	claim
88	40	A first study on strategies for generating workflow snippets	claim
89	40	Language-model-based ranking in entity-relation graphs	claim
90	40	A comparison of approaches to large-scale data analysis	claim
91	40	A framework for testing query transformation rules	claim
92	40	Core schema mappings	claim
93	40	SmartCIS: integrating digital and physical environments	claim
94	39	Robust and efficient algorithms for rank join evaluation	claim
95	39	FlexRecs: expressing and combining flexible recommendations	claim
96	39	Detecting and resolving unsound workflow views for correct provenance analysis	claim
97	38	FPGA: what's in it for a database?	claim
98	38	Optimizing i/o-intensive transactions in highly interactive applications	claim
99	38	Query by output	claim
100	38	Vispedia: on-demand data integration for interactive visualization and exploration	claim
101	37	Taming the storage dragon: the adventures of hoTMaN	claim
102	37	Search your memory ! - an associative memory based desktop search system	claim
103	37	Exploring schema repositories with schemr	claim
104	36	Query interactions in database workloads	claim
105	36	A grammar-based entity representation framework for data cleaning	claim
106	36	Robust web extraction: an approach based on a probabilistic tree-edit model	claim
107	35	Secondary-storage confidence computation for conjunctive queries with inequalities	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers